# A Multiple-Step Legendre-Gauss Collocation Method for Solving Volterra’s Population Growth Model

Authors: Majid Tavassoli Kajani; Mohammad Maleki; Adem Kılıçman
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

A new shifted Legendre-Gauss collocation method is proposed for the solution of Volterra’s model for population growth of a species in a closed system. Volterra’s model is a nonlinear integrodifferential equation on a semi-infinite domain, where the integral term represents the effects of toxin. In this method, by choosing a step size, the original problem is replaced with a sequence of initial value problems in subintervals. The obtained initial value problems are then step by step reduced to systems of algebraic equations using collocation. The initial conditions for each step are obtained from the approximated solution at its previous step. It is shown that the accuracy can be improved by either increasing the collocation points or decreasing the step size. The method seems easy to implement and computationally attractive. Numerical findings demonstrate the applicability and high accuracy of the proposed method.


---

## Body

## 1. Introduction

Many science and engineering problems arise in unbounded domains. During the last few years different spectral methods have been proposed for solving problems on unbounded domains. One of the methods is through the use of orthogonal polynomials over unbounded domains, such as the Hermite spectral and the Laguerre spectral methods [1–5]. However all of these algorithms need certain quadratures on unbounded domains, which introduce errors and so weaken the merit of spectral approximations. Another direct approach for solving such problems is based on rational approximations. Christov [6] and Boyd [7, 8] developed some spectral methods on unbounded intervals by using mutually orthogonal systems of rational functions. Boyd [8] defined a new spectral basis, named rational Chebyshev functions on the semi-infinite interval, by mapping it to the Chebyshev polynomials. Guo et al. [9] introduced a new set of rational Legendre functions which are mutually orthogonal in L2(0,+∞). They applied a spectral scheme using the rational Legendre functions for solving the Korteweg-de Vries equation on the half line. Boyd et al. [10] applied pseudospectral methods on a semi-infinite interval and compared the rational Chebyshev, Laguerre, and the mapped Fourier sine methods. Parand et al. [11] compared two common collocation approaches based on radial basis functions for the case of heat transfer equations arising in porous medium. The use of a suitable mapping to transfer infinite domains to the finite domains and then applying the standard spectral methods for the transformed problems in finite domains are considered another approach that is frequently used; see [12–16]. Another approach is replacing the infinite domain with [-T,T] and the semi-infinite interval with [0,T] by choosing T, sufficiently large. This method is named as the domain truncation [17, 18].In [19, 20], the Volterra model for population growth of a species within a closed system is given by
(1)dpdt^=ap-bp2-cp∫0t^‍p(x)dx,p(0)=p0,
where a>0 is the birth rate coefficient, b>0 is the crowding coefficient, c>0 is the toxicity coefficient, p0 is the initial population, and p=p(t^) denotes the population at time t^. Also, the coefficient c indicates the essential behavior of the population evolution before its level falls to zero in the long term.This model is an integroordinary differential equation where the termcp∫0t^‍p(x)dx represents the effect of toxin accumulation on the species. Although several time scales and population scales may be employed [20], here, we will scale time and population by introducing the nondimensional variables(2)t=t^b/c,u=pa/b,
which produce the nondimensional problem
(3)κdudt=u-u2-u∫0t‍u(x)dx,u(0)=u0,
where u(t) is the scaled population of identical individuals at time t and κ=c/(ab) is a prescribed nondimensional parameter. One may show that the only equilibrium solution of (3) is the trivial solution u(t)=0. In addition, the analytical solution [20]
(4)u(t)=u0exp(1κ∫0t‍[1-u(τ)-∫0τ‍u(x)dx]dτ)
shows that u(t)>0 for all t if u0>0.During the recent years, the solution of (3) has been of considerable concern. In [19], the successive approximations method was suggested for the solution of (3) but was not implemented. In this case, the solution u(t) has a smaller amplitude compared with the amplitude of u(t) for the case κ≪1. Similarly, in [20], the singular perturbation method for solving Volterra’s population model is considered. The author scaled out the parameters of (3) as much as possible by using four different ways and considered two cases: κ=c/(ab), small, and κ=c/(ab), large. Thus, it is shown in [20] that for the case κ≪1, where populations are weakly sensitive to toxins, a rapid rise occurs along the logistic curve that will reach a peak and then is followed by a slow exponential decay. In the case of large κ, the populations are strongly sensitive to toxins, and the solutions are proportional to sech2(t).In [21], four numerical methods, namely, the Euler method, the modified Euler method, the classical fourth-order Runge-Kutta method, and the Runge-Kutta-Fehlberg method, for the solution of (3) are proposed. Moreover, a phase-plane analysis is implemented. In [22] a comparison of the Adomian decomposition method and Sinc-Galerkin method is given and it is shown that the Adomian decomposition method is more efficient for the solution of Volterra’s population model. In [23], the series solution method and the decomposition method are implemented independently to (3) and to a related nonlinear ordinary differential equation. Furthermore, the Padé approximations are used in the analysis to capture the essential behavior of the population u(t) of identical individuals and approximation of umax and the exact value of umax for different κ were compared. The authors of [24–26] applied spectral method to solve Volterra’s population on a semi-infinite interval based on a rational Tau method.In [27], the approach is based upon domain truncation and composite spectral functions approximations. They first considered an interval [0,L], where L is any positive integer, and divided this interval into subintervals with step size h=1/N, where N is a positive integer. They then transformed each subinterval into [0,1) and utilized the properties of composite spectral functions consisting of few terms of orthogonal functions to reduce the solution of Volterra’s model to the solution of a system of algebraic equations.In [28], a numerical method based on domain truncation and hybrid functions was proposed to solve Volterra’s population model. They considered an interval [0,tf), and then by utilizing the properties of hybrid functions that consist of block-pulse and Lagrange-interpolating polynomials, they reduced the solution of Volterra’s model to the solution of a system of algebraic equations.In [29], the authors compared the application of rational Chebyshev collocation and Hermite functions collocation methods for solving Volterra’s population model. In [30], a new homotopy perturbation method is proposed for directly solving the Volterra’s population model as a nonlinear integrodifferential equation.In this paper, we introduce a new collocation method for solving (3). Volterra’s population model in (3) is first converted to an equivalent nonlinear initial value problem (IVP). This method solves the problem step by step and is valid for large domains. We first consider a step size and then replace the original IVP in the interval [0,∞) with a sequence of IVPs in subintervals with length equal to the considered step size. Then, the sequence of IVPs is consecutively reduced to sets of algebraic equations using collocation based on shifted Legendre-Gauss (ShLG) points. The initial conditions of the kth step (except for the first step, where the initial conditions are available) are obtained from the approximated solution obtained earlier at the (k-1)th step.The paper is organized as follows. In Section2, some basic properties of Legendre and shifted Legendre polynomials required for our subsequent development are given. Then the application of this method to Volterra’s population model is summarized. In Section 3, we report our numerical findings and demonstrate the efficiency and accuracy of the proposed scheme.


## 2. Step by Step Spectral Collocation Method for Volterra’s Population Model

In this section, we derive the step by step ShLG spectral collocation method for solving Volterra’s population model in (3).


### 2.1. Review of Legendre and Shifted Legendre Polynomials

The Legendre polynomials,Pn(x), n=0,1,…, are the eigenfunctions of the singular Sturm-Liouville problem
(5)((1-x2)Pn′(x))′+n(n+1)Pn(x)=0.
Also, they are orthogonal with respect to L2 inner product on the interval [-1,1] with the weight function w(x)=1; that is
(6)∫-11‍Pn(x)Pm(x)dx=22n+1δnm,
where δnm is the Kronecker delta. The Legendre polynomials satisfy the recursion relation
(7)Pn+1(x)=2n+1n+1xPn(x)-nn+1Pn-1(x),
where P0(x)=1 and P1(x)=x. If Pn(x) is normalized so that Pn(1)=1, then for any n, the Legendre polynomials in terms of power of x are
(8)Pn(x)=12n∑m=0[n/2]‍(-1)m(nm)(2n-2mn)xn-2m,
where [n/2] denotes the integer part of n/2.The Legendre-Gauss (LG) collocation points-1<x1<x2<⋯<xN-1<1 are the roots of PN-1(x). Explicit formulas for the LG points are not known. The LG points have the property that
(9)∫-11‍p(x)dx=∑i=1N-1‍wip(xi)
is exact for polynomials of degree at most 2N-3, where wi, 1⩽i⩽N-1, are LG quadrature weights. For more details about Legendre polynomials, see [31].The shifted Legendre polynomials on the intervalt∈[a,b] are defined by
(10)P^n(t)=Pn(1b-a(2t-a-b)),n=0,1,…,
which are obtained by an affine transformation from the Legendre polynomials. The set of shifted Legendre polynomials is a complete L2[a,b]-orthogonal system with the weight function w(t)=1. Thus, any function f∈L2[a,b] can be expanded in terms of shifted Legendre polynomials.The ShLG collocation pointsa<t1<t2<⋯<tN-1<b on the interval [a,b] are obtained by shifting the LG points, xi, using the transformation
(11)ti=12((b-a)xi+a+b),i=1,2,…,N-1.By using the property of standard LG quadrature, it follows that for any polynomialp of degree at most 2N-3 on (a,b),
(12)∫ab‍p(t)dt=b-a2∫-11‍p(12((b-a)x+a+b))dx=b-a2∑i=1N-1‍wip(12((b-a)xi+a+b))=∑i=1N-1‍w^ip(ti),
where w^i=((b-a)/2)wi, 1⩽i⩽N-1, are ShLG quadrature weights. The results stated above are also satisfied for Legendre-Gauss-Lobatto and Legendre-Gauss-Radau quadrature rules.


### 2.2.  Solution of Volterra’s Population Model

In this subsection, we first convert Volterra’s population model (3) to an equivalent nonlinear IVP. Let
(13)y(t)=∫0t‍u(x)dx,
which leads to
(14)y′(t)=u(t),y′′(t)=u′(t).
With substituting (13) and (14) into (3) the following nonlinear IVP is obtained:
(15)κy′′(t)=y′(t)-(y′(t))2-y(t)y′(t),0≤t<∞,y(0)=0,y′(0)=u0.
Then, to drive a step by step ShLG collocation method for solving (15), we first choose a step size h, where h can be any positive real number. Now, let yk(t) be the solution of (15) in subinterval Ik=[(k-1)h,kh], k=1,2,…. The IVP in (15) on the interval [0,∞) can be replaced with the following sequence of IVPs on subintervals Ik, k=1,2,…:
(16)κyk′′(t)=yk′(t)-(yk′(t))2-yk(t)yk′(t),t∈Ik,yk((k-1)h)=yk-1((k-1)h),yk′((k-1)h)=yk-1′((k-1)h),
where the initial conditions for the kth IVP (k⩾2) are considered using the solution obtained earlier for the (k-1)th IVP. Note that, for the first IVP, the initial conditions are available from (15). In addition, it is important to note that the initial conditions in (16) also maintained the continuity and the differentiability at the interface of subintervals. The calculations begin at the first step with solving the following IVP on I1=[0,h]:
(17)κy1′′(t)=y1′(t)-(y1′(t))2-y1(t)y1′(t),t∈I1,y1(0)=0,y1′(0)=u0.
This then allows the approximation of y2(t) on the subinterval I2 to be obtained at the second step from the IVP in (16) and so on.Consider now the ShLG collocation points(k-1)h<tk1<⋯<tk,N-1<kh on the kth subinterval Ik, k=1,2,…, obtained using (11). Obviously,
(18)tki=h2(xi+2k-1),i=1,2,…,N-1.
Also, consider two additional noncollocated points tk0=(k-1)h and tkN=kh. We approximate the function yk(t)∈L2(Ik) within each subinterval Ik by a polynomial of degree at most N as
(19)yk(t)≈IN(yk)(t)=∑j=0N‍ykjLkj(t),t∈Ik,
where ykj=yk(tkj) and
(20)Lkj(t)=∏l=0,l≠jN‍t-tkltkj-tkl,j=0,1,…,N
is a basis of Nth-degree Lagrange polynomials on the subinterval Ik that satisfy Lkj(tki)=δij. Here, it can be easily seen that for j=0,1,…,N and k=1,2,…, we have
(21)Lkj(t)=L1j(t-(k-1)h),t∈Ik.
Thus, by utilizing (21) for (19), the approximation of yk(t) within each subinterval Ik can be restated as
(22)yk(t)≈IN(yk)(t)=∑j=0N‍ykjL1j(t-(k-1)h),t∈Ik.
It is important to observe that the series (22) includes the Lagrange polynomials associated with the noncollocated points tk0=(k-1)h and tkN=kh. Differentiating the series of (22), twice, and evaluating at the ShLG collocation points tki, i=1,…,N-1, give
(23)yk(m)(tki)≈∑j=0N‍ykjL1j(m)(tki-(k-1)h)=∑j=0N‍ykjL1j(m)(t1i)=∑j=0N‍Dij(m)ykj,m=1,2,
where Dij(m)=L1j(m)(t1i). The (N-1)×(N+1) nonsquare matrices D(m)=[Dij(m)], m=1,2, are the first- and second-order Gauss pseudospectral differentiation matrices in the subinterval I1=[0,h], where we note that the extra columns of D(1) and D(2) are due to the Lagrange polynomials L10(t) and L1N(t) associated with the noncollocated points t10=0 and t1N=h.Further, it is seen from (21)–(23) that in the present step by step collocation scheme, we only need to produce the basis of Lagrange polynomials L1j(t) and the Gauss pseudospectral differentiation matrices D(1) and D(2) in the first subinterval. This reduces the number of arithmetic calculations and also the computational time, specially when the number of subintervals (number of steps) and/or the number of collocation points are large.Then, we define the residual function for thekth IVP on the subinterval Ik in (16) as follows:
(24)Res(t)=κ(IN(yk))′′(t)-(IN(yk))′(t)+((IN(yk))′(t))2+IN(yk)(t)(IN(yk))′(t).
At step k, the algebraic equations for obtaining the coefficients ykj come from equalizing Res(t) to zero at ShLG points plus two boundary conditions on the kth subinterval by utilizing (22)-(23):
(25)Res(tki)=0,i=1,…,N-1,yk0=yk-1,N,∑j=0N‍D1j(1)ykj=∑j=0N‍D1j(1)yk-1,j.
By using (25) we obtain a set of N+1 algebraic equations for unknowns yk0,…,ykN which can be solved using Newton’s iterative method. Again, we note that, in (25), the values of yk-1,j, j=0,…,N, are obtained earlier at step k-1. Consequently, at step k, using (25) the approximation of yk(t) in the kth subinterval Ik is obtained with substituting the obtained values of ykj into (22), which is indeed the approximate solution of Volterra’s model on the subinterval [(k-1)h,kh).


## 2.1. Review of Legendre and Shifted Legendre Polynomials

The Legendre polynomials,Pn(x), n=0,1,…, are the eigenfunctions of the singular Sturm-Liouville problem
(5)((1-x2)Pn′(x))′+n(n+1)Pn(x)=0.
Also, they are orthogonal with respect to L2 inner product on the interval [-1,1] with the weight function w(x)=1; that is
(6)∫-11‍Pn(x)Pm(x)dx=22n+1δnm,
where δnm is the Kronecker delta. The Legendre polynomials satisfy the recursion relation
(7)Pn+1(x)=2n+1n+1xPn(x)-nn+1Pn-1(x),
where P0(x)=1 and P1(x)=x. If Pn(x) is normalized so that Pn(1)=1, then for any n, the Legendre polynomials in terms of power of x are
(8)Pn(x)=12n∑m=0[n/2]‍(-1)m(nm)(2n-2mn)xn-2m,
where [n/2] denotes the integer part of n/2.The Legendre-Gauss (LG) collocation points-1<x1<x2<⋯<xN-1<1 are the roots of PN-1(x). Explicit formulas for the LG points are not known. The LG points have the property that
(9)∫-11‍p(x)dx=∑i=1N-1‍wip(xi)
is exact for polynomials of degree at most 2N-3, where wi, 1⩽i⩽N-1, are LG quadrature weights. For more details about Legendre polynomials, see [31].The shifted Legendre polynomials on the intervalt∈[a,b] are defined by
(10)P^n(t)=Pn(1b-a(2t-a-b)),n=0,1,…,
which are obtained by an affine transformation from the Legendre polynomials. The set of shifted Legendre polynomials is a complete L2[a,b]-orthogonal system with the weight function w(t)=1. Thus, any function f∈L2[a,b] can be expanded in terms of shifted Legendre polynomials.The ShLG collocation pointsa<t1<t2<⋯<tN-1<b on the interval [a,b] are obtained by shifting the LG points, xi, using the transformation
(11)ti=12((b-a)xi+a+b),i=1,2,…,N-1.By using the property of standard LG quadrature, it follows that for any polynomialp of degree at most 2N-3 on (a,b),
(12)∫ab‍p(t)dt=b-a2∫-11‍p(12((b-a)x+a+b))dx=b-a2∑i=1N-1‍wip(12((b-a)xi+a+b))=∑i=1N-1‍w^ip(ti),
where w^i=((b-a)/2)wi, 1⩽i⩽N-1, are ShLG quadrature weights. The results stated above are also satisfied for Legendre-Gauss-Lobatto and Legendre-Gauss-Radau quadrature rules.


## 2.2.  Solution of Volterra’s Population Model

In this subsection, we first convert Volterra’s population model (3) to an equivalent nonlinear IVP. Let
(13)y(t)=∫0t‍u(x)dx,
which leads to
(14)y′(t)=u(t),y′′(t)=u′(t).
With substituting (13) and (14) into (3) the following nonlinear IVP is obtained:
(15)κy′′(t)=y′(t)-(y′(t))2-y(t)y′(t),0≤t<∞,y(0)=0,y′(0)=u0.
Then, to drive a step by step ShLG collocation method for solving (15), we first choose a step size h, where h can be any positive real number. Now, let yk(t) be the solution of (15) in subinterval Ik=[(k-1)h,kh], k=1,2,…. The IVP in (15) on the interval [0,∞) can be replaced with the following sequence of IVPs on subintervals Ik, k=1,2,…:
(16)κyk′′(t)=yk′(t)-(yk′(t))2-yk(t)yk′(t),t∈Ik,yk((k-1)h)=yk-1((k-1)h),yk′((k-1)h)=yk-1′((k-1)h),
where the initial conditions for the kth IVP (k⩾2) are considered using the solution obtained earlier for the (k-1)th IVP. Note that, for the first IVP, the initial conditions are available from (15). In addition, it is important to note that the initial conditions in (16) also maintained the continuity and the differentiability at the interface of subintervals. The calculations begin at the first step with solving the following IVP on I1=[0,h]:
(17)κy1′′(t)=y1′(t)-(y1′(t))2-y1(t)y1′(t),t∈I1,y1(0)=0,y1′(0)=u0.
This then allows the approximation of y2(t) on the subinterval I2 to be obtained at the second step from the IVP in (16) and so on.Consider now the ShLG collocation points(k-1)h<tk1<⋯<tk,N-1<kh on the kth subinterval Ik, k=1,2,…, obtained using (11). Obviously,
(18)tki=h2(xi+2k-1),i=1,2,…,N-1.
Also, consider two additional noncollocated points tk0=(k-1)h and tkN=kh. We approximate the function yk(t)∈L2(Ik) within each subinterval Ik by a polynomial of degree at most N as
(19)yk(t)≈IN(yk)(t)=∑j=0N‍ykjLkj(t),t∈Ik,
where ykj=yk(tkj) and
(20)Lkj(t)=∏l=0,l≠jN‍t-tkltkj-tkl,j=0,1,…,N
is a basis of Nth-degree Lagrange polynomials on the subinterval Ik that satisfy Lkj(tki)=δij. Here, it can be easily seen that for j=0,1,…,N and k=1,2,…, we have
(21)Lkj(t)=L1j(t-(k-1)h),t∈Ik.
Thus, by utilizing (21) for (19), the approximation of yk(t) within each subinterval Ik can be restated as
(22)yk(t)≈IN(yk)(t)=∑j=0N‍ykjL1j(t-(k-1)h),t∈Ik.
It is important to observe that the series (22) includes the Lagrange polynomials associated with the noncollocated points tk0=(k-1)h and tkN=kh. Differentiating the series of (22), twice, and evaluating at the ShLG collocation points tki, i=1,…,N-1, give
(23)yk(m)(tki)≈∑j=0N‍ykjL1j(m)(tki-(k-1)h)=∑j=0N‍ykjL1j(m)(t1i)=∑j=0N‍Dij(m)ykj,m=1,2,
where Dij(m)=L1j(m)(t1i). The (N-1)×(N+1) nonsquare matrices D(m)=[Dij(m)], m=1,2, are the first- and second-order Gauss pseudospectral differentiation matrices in the subinterval I1=[0,h], where we note that the extra columns of D(1) and D(2) are due to the Lagrange polynomials L10(t) and L1N(t) associated with the noncollocated points t10=0 and t1N=h.Further, it is seen from (21)–(23) that in the present step by step collocation scheme, we only need to produce the basis of Lagrange polynomials L1j(t) and the Gauss pseudospectral differentiation matrices D(1) and D(2) in the first subinterval. This reduces the number of arithmetic calculations and also the computational time, specially when the number of subintervals (number of steps) and/or the number of collocation points are large.Then, we define the residual function for thekth IVP on the subinterval Ik in (16) as follows:
(24)Res(t)=κ(IN(yk))′′(t)-(IN(yk))′(t)+((IN(yk))′(t))2+IN(yk)(t)(IN(yk))′(t).
At step k, the algebraic equations for obtaining the coefficients ykj come from equalizing Res(t) to zero at ShLG points plus two boundary conditions on the kth subinterval by utilizing (22)-(23):
(25)Res(tki)=0,i=1,…,N-1,yk0=yk-1,N,∑j=0N‍D1j(1)ykj=∑j=0N‍D1j(1)yk-1,j.
By using (25) we obtain a set of N+1 algebraic equations for unknowns yk0,…,ykN which can be solved using Newton’s iterative method. Again, we note that, in (25), the values of yk-1,j, j=0,…,N, are obtained earlier at step k-1. Consequently, at step k, using (25) the approximation of yk(t) in the kth subinterval Ik is obtained with substituting the obtained values of ykj into (22), which is indeed the approximate solution of Volterra’s model on the subinterval [(k-1)h,kh).


## 3. Numerical Results

We apply the method presented in this paper to examine the mathematical structure ofu(t). In particular, we seek to study the rapid growth along the logistic curve that will reach a peak, followed by the slow exponential decay where u(t)→0 as t→∞. The mathematical behavior so defined was introduced by Scudo [19] and justified by Small [20] based on singular perturbation methods. Further, these properties were also confirmed by TeBeest [21] upon using a phase-plane analysis, Wazwaz [23] by applying Adomian decomposition method (ADM), Ramezani et al. [27] by using composite spectral functions (CSF), Marzban et al. [28] by using hybrid of block-pulse and Lagrange polynomials (HBL), and Parand et al. [29] by using rational Chebyshev collocation (RCC) and Hermite functions collocation methods (HFC).We applied the method presented in this paper and solved (3) for u0=0.1 and κ= 0.02, 0.04, 0.1, 0.2, and 0.5 and then evaluated umax, which are also evaluated in [23, 27–29]. In Table 1, the resulting values using the present method with different step sizes, together with the results given in [23, 27–29] and exact values
(26)umax=1+κln(κ1+κ-u0)
reported in [21], are presented. Compared with other methods, our method provides more accurate numerical results. Note that the step sizes considered in Table 1 are based on the position of umax. To this end, for all values of κ, we first solved the problem with the step size h=1 and N=15 to find the approximate position of umax. Then for each value of κ we selected an appropriate step size.Table 1
A comparison of methods in [23, 27–29] and the present method with the exact values for umax.
κ
ADM [23]
CSF [27]
RCC [29]
HBL [28]
h
N
Present
Exactumax
0.02
0.9038380533
0.9234262
0.92342715
0.9234271721
0.1
28
0.92342717207027
0.92342717207022
0.04
0.861240177
0.8737192
0.87371998
0.8737199832
0.15
22
0.87371998315393
0.87371998315399
0.1
0.7651130834
0.7697409
0.76974149
0.7697414907
0.25
19
0.76974149070061
0.76974149070060
0.2
0.6579123080
0.6590497
0.65905038
0.6590503815
0.5
18
0.65905038155231
0.65905038155231
0.5
0.4852823482
0.4851898
0.48519030
0.4851902914
1.0
20
0.48519029140942
0.48519029140942Figure1 shows the results of the present step by step collocation method for κ= 0.02, 0.04, 0.1, 0.2, and 0.5. This figure shows the rapid rise along the logistic curve followed by the slow exponential decay after reaching the maximum point, and when κ increases, the amplitude of u(t) decreases whereas the exponential decay increases. Also, this figure shows the stability of the present method in large number of steps calculations.Figure 1
The results of the present method calculation forκ= 0.02, 0.04, 0.1, 0.2, and 0.5, in the order of height.


## 4. Conclusion

A new efficient step by step collocation method based on shifted Legendre-Gauss points has been proposed for solving Volterra model for population growth of a species in a closed system. We considered a step size and converted the original IVP raised from Volterra’s population model to a sequence of IVPs in subintervals and solved them, step by step, using collocation. This approach is easy to implement and possesses the spectral accuracy. Furthermore, this method is available for large domain calculations. Numerical example shows the excellent agreement between the approximate and exact values forumax.



---

*Source: 783069-2013-12-07.xml*