Journal of Applied Mathematics

Volume 2012 (2012), Article ID 103205, 13 pages

doi:10.1155/2012/103205

Research Article

A Nonclassical Radau Collocation Method for Nonlinear Initial-Value Problems with Applications to Lane-Emden Type Equations

Mohammad Maleki,¹ M. Tavassoli Kajani,² I. Hashim,¹ A. Kilicman,³ and K. A. M. Atan⁴

¹School of Mathematical Sciences, Universiti Kebangsaan Malaysia, 43600 Bangi, Selangor, Malaysia

²Department of Mathematics, Islamic Azad University, Khorasgan Branch, Isfahan 71595, Iran

³Department of Mathematics, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia

⁴Institute for Mathematical Research (INSPEM), Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia

Received 21 March 2012; Revised 16 September 2012; Accepted 16 September 2012

Academic Editor: Igor Andrianov

Copyright © 2012 Mohammad Maleki et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We propose a numerical method for solving nonlinear initial-value problems of Lane-Emden type. The method is based upon nonclassical Gauss-Radau collocation points, and weighted interpolation. Nonclassical orthogonal polynomials, nonclassical Radau points and weighted interpolation are introduced on arbitrary intervals. Then they are utilized to reduce the computation of nonlinear initial-value problems to a system of nonlinear algebraic equations. We also present the comparison of this work with some well-known results and show that the present solution is very accurate.

1. Introduction

Many problems in the literature of mathematical physics can be formulated as equations of the Lane-Emden type defined in the form

subject to

where prime denotes differentiation with respect to . The solution of the Lane-Emden equation, as well as those of a variety of nonlinear problems in quantum mechanics and astrophysics such as the scattering length calculations in the variable phase approach, is numerically challenging because of the singular point at the origin. Equations (1.1) and (1.2) with specializing and occur in several models of mathematical physics and astrophysics such as the theory of stellar structure, the thermal behavior of a spherical cloud of gas, and theories of thermionic currents. It has been studied widely in the literature; see, for example, [1–12]. This equation was first studied by the astrophysicists Jonathan Homer Lane and Robert Emden, which considered the thermal behavior of a spherical cloud of gas acting under the mutual attraction of its molecules and subject to the classical laws of thermodynamics [13]. For , and in (1.1) and (1.2), we obtain the standard Lane-Emden equation of index which has been the object of much study [1–3]. It was physically shown that interesting values of lie in the interval , and this equation has analytical solutions for , 1 and 5. Various alternative techniques have been developed for the solution of the Lane-Emden equation in the literature. Among others, this equation has been solved by means of perturbation methods and a Padé approximation (Bender et al. [2]), Adomian's decomposition method [3], the quasilinearization method of [4], the homotopy analysis method [5, 6], a variational approach which uses a semi-inverse method to obtain a variational principle [7], a power series solution [8], a linearization technique [9, 10], the variational iteration method [11, 12], hybrid functions collocation method [14], Lagrangian method [15], Hermite functions collocation method [16], Sinc-Collocation method [17], rational Legendre pseudospectral approach [18], a modified Legendre-spectral method [19], and a numerical technique based on converting the Lane-Emden equations into integral equations [20].

In the present paper, we first consider the nonlinear ordinary differential equations of the form

with initial conditions

We assume that (1.3) and (1.4) have a unique solution to be determined. We then solve a variety of Lane-Emden equations which fall into this category. Here, we introduce a new direct computational method for solving (1.3) and (1.4). This method consists of reducing the solution of (1.3) and (1.4) to a set of algebraic equations by first interpolating using weighted Lagrange interpolation based on Freud-type weights and sets of nonclassical Gauss-Radau (NGR) nodes. These nodes, which arise from nonclassical orthogonal polynomials based on Freud-type weights over interval , are presented. Equation (1.3) is then collocated at these NGR collocation points to evaluate the unknown coefficients, which are the values of the function at these collocation points.

This paper is organized as follows. In Section 2, we describe the generation of NGR collocation points, function approximation, and selection of weights. In Section 3, we explain our method, and in Section 4, the present method is applied to a nonlinear Lane-Emden equation as well as the standard Lane-Emden equation of index . The numerical solutions are compared in Section 5 with available exact or approximate solutions in order to assess the accuracy of the proposed method.

2. Nonclassical Radau Collocation Method

2.1. NGR Points

In classical pseudospectral methods [14, 22–24], the classical Gauss-Lobatto and Gauss-Radau collocation points are based on Chebyshev or Legendre polynomials and lie on the closed interval and half-open interval , respectively. In the present work, we consider the generation of the NGR collocation points based on nonclassical orthogonal polynomials with respect to exponential weights in the intervals where and are any real numbers.

Let be the number of collocation points and let be the th-degree nonclassical orthogonal polynomial with respect to weight which can be obtained from the following three-term recurrence relation [25]:

The recurrence coefficients in (2.1) are given in [26] by

The NGR collocation points for are obtained by the method outlined by Golub [27]. The tridiagonal Jacobi-Radau matrix of order is defined by

where is obtained from

Theorem 2.1 (see Golub [27]). The Gauss-Radau nodes are the eigenvalues of , and the Gauss-Radau weights are given by

where is the normalized eigenvector of corresponding to the eigenvalue (i.e., ) and its first component.

2.2. Function Approximation and Differentiation Matrices

Consider the NGR collocation points defined in Section 2.1 on the interval and additional noncollocated point . The function is approximated by weighted Lagrange interpolation as [26, 28]

where is a positive and bounded weight function, and ,

is a basis of th-degree Lagrange polynomials. Notice that the basis includes the function corresponding to the terminal value . Differentiating twice the series of (2.6) and evaluating the NGR collocation points , give

where

and are the th row of and ,

The rectangular matrices and formed by the coefficients and , ; are the first and second order Gauss-Radau differentiation matrices, respectively. These matrices transform the approximation of at to the first and second derivatives of at the collocation points .

2.3. Weight Selection

When studying the uniform convergence behavior of the weighted Lagrange interpolation as , a crucial role is played by the Lebesgue function

and the Lebesgue constant

(see, e.g., [29–32] and references therein).

In general, the orthogonal weight function and weight of interpolation are chosen independently [26, 28, 33–35]. Nevertheless, if we expect a reasonable upper estimate for the Lebesgue constant, then we have to assume some connections between these two weights. The most natural assumption, as suggested in [29], is to generate the interpolation nodes (collocation points) with respect to the weight . In addition, to obtain uniform convergence in weighted interpolation some conditions on should be considered. The Bernstein's approximation problem deals with the uniform convergence behavior of weighted interpolation. The problem is as follows

Let be measurable. When it is true that for every continuous with

there exist a sequence of polynomials with

The condition is essential to counteract the growth of any polynomial at infinity.

As stated above, the Lebesgue constant plays an important role in answering the Bernstein's problem. Now it is known that for any set of interpolation nodes and any weight , is unbounded with respect to . A consequence of this is that there exists such that weighted interpolation does not converge uniformly to . However, if is not too badly behaved (e.g., as measured by the modulus of continuity) and the are not too large, then uniform convergence is achieved (as positive answers to the Bernstein’s problem).

The Freud-type weights, as positive answers to the Bernstein’s problem, (see, e.g., [36]) are defined as with the following conditions: is even, continuous in , is continuous in , on and for some

If is a Freud weight we write , and if, moreover, is differentiable in , we write . By definition, if , then , too. Canonical example is as

Clearly with . In this work, we consider the Freud weight with .

Vértesi in [32] has shown that given a Freud-type weight satisfying the previous conditions and any set of interpolation nodes

3. Solution of Nonlinear Initial-Value Problems

Our discrete approximation to the nonlinear initial-value problem in (1.3)-(1.4) is obtained by evaluating (2.6) at collocation points and replacing and by their discrete approximations in (2.8), and evaluating the boundary conditions in (1.4) at collocation point . Hence, the discrete approximation to the nonlinear initial-value problem is

Using (3.1) and (3.2), we obtain a system of nonlinear algebraic equations which can be solved using the Newton's iterative method.

It is well known that the initial guess for Newton's iterative method is very important especially for complicated problems. To choose the initial guess for our problem, in the first stage we set and apply the Newton's iterative method for solving nonlinear equations by choosing in (1.4) as our initial guess. We then increase by 5 and use the approximate solution in stage one as our initial guess in this stage. We continue this approach until the results are similar up to a required number of decimal places for two consecutive stages.

It is worth mentioning that, in the case that the initial-value problem has a singularity at (e.g., the Lane-Emden type equations), this method avoids the singularity, because we compute (3.1) at the collocation points that are straightly more than zero.

4. Illustrative Examples

We applied the method presented in this paper and solved two problems. The first example is a nonlinear Lane-Emden equation considered in [10] and the second example is the standard Lane-Emden equation of index . As stated in Section 2.3, we consider the Freud-type weight as interpolation weight function and generate the nonclassical orthogonal polynomials and the NGR collocation points in the intervals with respect to the weight .

Example 4.1. This example corresponds to the following singular nonlinear Lane-Emden equation [10]:

which has the following exact solution:

Define

where and denote the approximate solution obtained by the present method and the exact solution, respectively. In Table 1, the maximum absolute errors between approximate and exact solutions are denoted by , and maximum absolute error between the derivative of approximate and exact solutions is denoted by , for different values of and are given, which show the efficiency of the present method in large interval calculation. Further, in Table 2 a comparison is made between the values of obtained using the present method for and together with the values given in [16] using Hermite functions collocation method and the exact solutions.

Table 1: The maximum absolute errors and for Example 4.1.

20
20

25

30

10
20

25

30

5
20

25

30

Table 2: Comparison of between present method, method in [16] and the exact values for Example 4.1.

Method in [16]
Error
Present method
Error
Exact

0.00
0.0000000000

0.0000000000

0.0000000000

0.01
−0.0001970587

−0.0001999904

−0.0001999900

0.10
−0.0198967225

−0.0199006640

−0.0199006617

0.50
−0.4462840851

−0.4462870994

−0.4462871026

1.00
−1.3862934297

−1.3862943490

−1.3862943611

2.00
−3.2188763248

−3.2188758411

−3.2188758249

3.00
−4.6051709964

−4.6051702055

−4.6051701860

4.00
−5.6664274573

−5.6664266969

−5.6664266881

5.00
−6.5161937402

−6.5161930821

−6.5161930760

6.00
−7.2218363729

−7.2218358310

−7.2218358253

7.00
−7.8240461812

−7.8240460154

−7.8240460109

8.00
−8.3487734467

−8.3487745418

−8.3487745398

9.00
−8.8134506165

−8.8134384925

−8.8134384945

10.00
−9.2302027821

−9.2302410337

−9.2302410337

Example 4.2. Consider the standard Lane-Emden equation of index given by

This equation is linear for and 1, nonlinear otherwise, and exact solutions exist only for and 5 and are given in Bender et al. [2], respectively, by

Moreover, Bender et al. [2] determined the zeros of asymptotically, here denoted by , and found that

for and 1.5 which correspond to , and 4, respectively.

We applied the method presented in this paper and solved this example and then evaluated the zeros of , which are also evaluated in [10] using linearization technique, in [15] by using Lagrangian method, and in [16] using Hermite functions collocation method.

The selection of is crucial for the computing of zero, , of . In order to obtain reasonable approximations of zeros, for each value of , in the first stage we select a sufficiently large and set then we solve the problem using the present method to obtain as the first approximation of the zero. Then according to the obtained we select a value for . Finally, we resolve the problem for different values of .

In Table 3, the resulting values of the zeros of for using the present method for different , with the results obtained in [10, 15, 16] together with the exact solutions of Horedt [21], are presented. Table 3 shows that the present method provides very accurate predictions of the zeros of even in large intervals. In order to demonstrate the accuracy of the proposed method, in Tables 4 and 5 we have compared the numerical results of using the present method for , and , , respectively, with the methods in [15–17, 21]. In addition, Table 6 shows the maximum absolute errors for , for which the exact solution exists, with and choosing different values of . As can be seen from Tables 3-6, the present method provides very accurate results even for large values of . The resulting graphs of the standard Lane-Emden equation for and 4.5 and different values of given in Table 3 are shown in Figure 1.

Table 3: Comparison of numerical results for () for Example 4.2.

Present method
Method in [10]
Method in [15]
Method in [16]
Exact [21]

0
20
2.4494897427832
2.44899
—
—
2.4494897427832

0.5
27
2.752698051
—
—
—
2.75269805

1
20
3.1415926535898
3.14048
—
—
3.1415926535898

1.5
25
3.65375374
—
—
3.65375374
3.65375374

2
15
4.35287460
4.35086
4.352875
4.35287460
4.35287460

2.5
17
5.35527546
—
—
5.35527546
5.35527546

3
25
6.89684862
6.89312
6.896846
6.89684862
6.89684862

3.5
25
9.53580535
—
—
—
9.53580534

4
30
14.9715464
14.96518
14.971546
14.9715463
14.9715463

4.5
30
31.8364633
—
—
—
31.8364632

Table 4: Comparison of for present method, and other methods in the literature for .

Present method
Error
Error in [17]
Error in [15]
Error in [16]
Exact [21]

0.000
1.0000000000
0.00
0.00
0.00
0.00
1.0000000000

0.100
0.9983358295
2.95
1.82
1.28
1.40
0.9983358000

0.500
0.9598390699
3.00
1.12
1.81
2.99
0.9598391000

1.000
0.8550575686
3.14
1.07
6.00
1.99
0.8550576000

5.000
0.1108198351
3.51
2.02
2.00
3.90
0.1108198000

6.000
0.0437379839
3.90
5.00
2.00
1.14
0.0437379800

6.800
0.0041677894
4.00
2.93
2.79
1.05
0.0041677890

6.896
0.0000360111
1.00
2.10
1.01
8.88
0.0000360112

Table 5: Comparison of for present method, and other methods in the literature for .

Present method
Error
Error in [16]
Exact [21]

0.0
1.0000000000

1.0000000000

0.1
0.9983366596

0.9983367000

0.2
0.9933862134

0.9933862000

0.5
0.9603109024

0.9603109000

1.0
0.8608138124

0.8608138000

5.0
0.2359227314

0.2359227000

10.0
0.0596727418

0.0596727400

14.0
0.0083305270

0.0083305270

14.9
0.0005764180

0.0005764189

Table 6: The maximum absolute errors and for and .

40

30

20

10

5

Figure 1: Lane-Emden graphs obtained by the present method for .

5. Comparison with Other Methods

As stated in the Introduction section, the Lane-Emden equations have been widely solved using both numerical and analytical methods. In this section we aim to present the advantages of our numerical method over some other existing methods in the literature.

(i) Comparison with some analytical solutions: among others, the Lane-Emden equations have been solved with the variational iteration method [11, 12], homotopy-perturbation method [5, 6], and the Adomian decomposition method [3]. However, this type of solution methods is dependent on the initial guess so that the obtained series solution is changed with changing the initial guess, whereas the present method is not dependent on the initial guess. Furthermore, in the mentioned methods the interval of convergence of the obtained series solution is limited (usually ), whereas Section 4 shows that our method provides accurate approximate solutions in larger domains. For instance, consider Example 4.1 of Section 4. The series solution for this example in [3, 6, 12] is as follows:

 which converges to the exact solution only on the interval , while we have solved this example with high accuracy in the interval . Note that in the mentioned analytical solutions, Padé approximant can be implemented for manipulating a polynomial approximation into a rational function to gain more information about the approximate solution. Nevertheless, comparison between Figure 1 of Wazwaz [3] obtained using Padé approximants [6/6] with Figure 1 and Table 3 of this paper shows that our method provides much more accurate predictions of the zeros of the standard Lane-Emden equation in Example 4.2.(ii) Comparison with some spectral methods: several spectral methods have been established for solving the Lane-Emden equations [15–20]. Methods in [19, 20] can only be implemented in the interval , while our method can be implemented in larger interval. Further, methods in [15–18] are based on orthogonal functions on the semi-infinite interval , such as Laguerre functions, Hermite functions, and radial basis functions. All of these methods need certain quadratures on unbounded domains, which introduce errors and so weaken the merit of spectral approximations. Moreover, for an infinitely smooth function , the spectral convergence of the truncated series in these functions occurs only if decays exponentially fast at . According to these reasons, we see from Tables 2–5 that our method provides more accurate numerical results. Also, Table 3 shows that the spectral methods in [15–18] can solve the standard Lane-Emden equation up to the interval , whereas we have solved this equation with high accuracy up to the interval .(iii) The present method has also the following advantages: first, for another type of equations the Freud-type weights described in Section 2.3 can be tuned to improve the accuracy of the discrete approximation. Second, this method provides very accurate results with moderate number of collocation points even in large intervals. Third, methods in [26, 28, 33–35], by considering some arbitrary weight functions, have utilized nonclassical basis polynomials on the interval . But, in the present work we have developed this idea over an arbitrary interval based on the Freud-type weights.

6. Conclusion

The Lane-Emden equation occurs in the theory of stellar structure and describes the temperature variation of a spherical gas cloud. The difficulty in this type of equations, due to the existence of singular point at , is overcome here. In the standard Lane-Emden equation, the first zero of is an important point of the function, so we have computed up to this zero by utilizing the nonclassical Radau collocation method. A set of nonclassical orthogonal polynomials based on Freud-type weights is proposed to provide an effective but simple way to improve the convergence of the solution by a Radau collocation method. Numerical examples demonstrate the validity and high accuracy of the technique.

Acknowledgments

The present paper was prepared during the second author’s visit to Institute for Mathematical Research (INSPEM), UPM. The second author thanks the staff of INSPEM for the kind hospitality.

References

S. Chandrasekhar, An Introduction to the Study of Stellar Structure, Dover, New York, NY, USA, 1967.

C. M. Bender, K. A. Milton, S. S. Pinsky, and L. M. Simmons, Jr., “A new perturbative approach to nonlinear problems,” Journal of Mathematical Physics, vol. 30, no. 7, pp. 1447–1455, 1989.

A.-M. Wazwaz, “A new method for solving singular initial value problems in the second-order ordinary differential equations,” Applied Mathematics and Computation, vol. 128, no. 1, pp. 45–57, 2002.

V. B. Mandelzweig and F. Tabakin, “Quasilinearization approach to nonlinear problems in physics with application to nonlinear ODEs,” Computer Physics Communications, vol. 141, no. 2, pp. 268–281, 2001.

S. Liao, “A new analytic algorithm of Lane-Emden type equations,” Applied Mathematics and Computation, vol. 142, no. 1, pp. 1–16, 2003.

M. S. H. Chowdhury and I. Hashim, “Solutions of Emden-Fowler equations by homotopy-perturbation method,” Nonlinear Analysis. Real World Applications, vol. 10, no. 1, pp. 104–115, 2009.

J.-H. He, “Variational approach to the Lane-Emden equation,” Applied Mathematics and Computation, vol. 143, no. 2-3, pp. 539–541, 2003.

M. I. Nouh, “Accelerated power series solution of polytropic and isothermal gas spheres,” New Astronomy, vol. 9, pp. 467–473, 2004.

J. I. Ramos, “Linearization methods in classical and quantum mechanics,” Computer Physics Communications, vol. 153, no. 2, pp. 199–208, 2003.

J. I. Ramos, “Linearization techniques for singular initial-value problems of ordinary differential equations,” Applied Mathematics and Computation, vol. 161, no. 2, pp. 525–542, 2005.

M. Dehghan and F. Shakeri, “Approximate solution of a differential equation arising in astrophysics using the variational iteration method,” New Astronomy, vol. 13, pp. 53–59, 2008.

A. Yıldırım and T. Öziş, “Solutions of singular IVPs of Lane-Emden type by the variational iteration method,” Nonlinear Analysis. Theory, Methods & Applications, vol. 70, no. 6, pp. 2480–2484, 2009.

H. T. Davis, Introduction to Nonlinear Differential and Integral Equations, Dover, New York, ,NY, USA, 1962.

H. R. Marzban, H. R. Tabrizidooz, and M. Razzaghi, “Hybrid functions for nonlinear initial-value problems with applications to Lane-Emden type equations,” Physics Letters A, vol. 372, no. 37, pp. 5883–5886, 2008.

K. Parand, A. R. Rezaei, and A. Taghavi, “Lagrangian method for solving Lane-Emden type equation arising in astrophysics on semi-infinite domains,” Acta Astronautica, vol. 67, p. 673, 2010.

K. Parand, M. Dehghan, A. R. Rezaei, and S. M. Ghaderi, “An approximation algorithm for the solution of the nonlinear Lane-Emden type equations arising in astrophysics using Hermite functions collocation method,” Computer Physics Communications, vol. 181, no. 6, pp. 1096–1108, 2010.

K. Parand and A. Pirkhedri, “Sinc-Collocation method for solving astrophysics equations,” New Astronomy, vol. 15, pp. 533–537, 2010.

K. Parand, M. Shahini, and M. Dehghan, “Rational Legendre pseudospectral approach for solving nonlinear differential equations of Lane-Emden type,” Journal of Computational Physics, vol. 228, no. 23, pp. 8830–8840, 2009.

H. Adibi and A. M. Rismani, “On using a modified Legendre-spectral method for solving singular IVPs of Lane-Emden type,” Computers & Mathematics with Applications, vol. 60, no. 7, pp. 2126–2130, 2010.

S. Karimi Vanani and A. Aminataei, “On the numerical solution of differential equations of Lane-Emden type,” Computers & Mathematics with Applications, vol. 59, no. 8, pp. 2815–2820, 2010.

G. P. Horedt, Polytropes Applications in Astrophysics and Related Fields, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004.

G. Elnagar, M. A. Kazemi, and M. Razzaghi, “The pseudospectral Legendre method for discretizing optimal control problems,” IEEE Transactions on Automatic Control, vol. 40, no. 10, pp. 1793–1796, 1995.

G. N. Elnagar and M. A. Kazemi, “Pseudospectral Chebyshev optimal control of constrained nonlinear dynamical systems,” Computational Optimization and Applications, vol. 11, no. 2, pp. 195–217, 1998.

D. Garg, M. Ptterson, W. W. Hager, A. V. Rao, and D. A. Benson, “A unified framework for the numerical solution of optimal control problems using pseudospectral methods,” Automatica, vol. 46, p. 1843, 2010.

B. Shizgal, “A Gaussian quadrature procedure for use in the solution of the Boltzmann equation and related problems,” Journal of Computational Physics, vol. 41, no. 2, pp. 309–328, 1981.

B. Shizgal and H. Chen, “The quadrature discretization method (QDM) in the solution of the Schrödinger equation with nonclassical basis functions,” Journal of Chemical Physics, vol. 104, 4137 pages, 1996.

G. H. Golub, “Some modified matrix eigenvalue problems,” SIAM Review, vol. 15, pp. 318–334, 1973.

M. Maleki and M. Mashali-Firouzi, “A numerical solution of problems in calculus of variation using direct method and nonclassical parameterization,” Journal of Computational and Applied Mathematics, vol. 234, no. 5, pp. 1364–1373, 2010.

J. Szabados, “Weighted Lagrange and Hermite-Fejér interpolation on the real line,” Journal of Inequalities and Applications, vol. 1, no. 2, pp. 99–123, 1997.

S. B. Damelin, “The asymptotic distribution of general interpolation arrays for exponential weights,” Electronic Transactions on Numerical Analysis, vol. 13, pp. 12–21, 2002.

D. S. Lubinsky, “A survey of weighted polynomial approximation with exponential weights,” Surveys in Approximation Theory, vol. 3, pp. 1–105, 2007.

P. Vértesi, “On the Lebesgue function of weighted Lagrange interpolation—I. (Freud-type weights),” Constructive Approximation, vol. 15, no. 3, pp. 355–367, 1999.

J. A. C. Weideman, “Spectral methods based on nonclassical orthogonal polynomials,” in Applications and Computation of Orthogonal Polynomials, vol. 131 of International Series of Numerical Mathematics, pp. 239–251, Birkhäuser, Basel, Switzerland, 1999.

H. Chen and B. D. Shizgal, “A spectral solution of the Sturm-Liouville equation: comparison of classical and nonclassical basis sets,” Journal of Computational and Applied Mathematics, vol. 136, no. 1-2, pp. 17–35, 2001.

A. Alipanah, M. Razzaghi, and M. Dehghan, “Nonclassical pseudospectral method for the solution of brachistochrone problem,” Chaos, Solitons and Fractals, vol. 34, no. 5, pp. 1622–1628, 2007.

G. Criscuolo, B. Della Vecchia, D. S. Lubinsky, and G. Mastroianni, “Functions of the second kind for Freud weights and series expansions of Hilbert transforms,” Journal of Mathematical Analysis and Applications, vol. 189, no. 1, pp. 256–296, 1995.