Adomian decomposition method by Legendre polynomials

In this paper, an efficient modification of the Adomian decomposition method by using Legendre polynomials is presented. Both linear and non-linear models are suited for the proposed method. Some examples here in are solved by using this method and this paper will demonstrate that the results are more reliable and efficient.     

Beyond Adomian polynomials: He polynomials

The Adomian decomposition method is widely used in approximate calculation. The main difficulty of the method is to calculate Adomian polynomials, the procedure is very complex. In order to overcome the demerit, this paper suggests an alternative approach to Adomian method, instead of Adomian polynomials, He polynomials are introduced based on homotopy perturbation method. The solution procedure becomes easier, simpler, and more straightforward.     

关于勒让德多项式与契贝谢夫多项式间的关系

主要研究勒让德多项式与契贝谢夫多项式之间的关系的性质,利用生成函数和函数级数展开的方法,得出了勒让德多项式与契贝谢夫多项式之间的一个重要关系,这对勒让德多项式与契贝谢夫多项式的研究有一定的推动作用．     

勒让德多项式的性质与契贝谢夫多项式间的关系

主要讨论了著名的勒让德多项式的一些性质,同时得到勒让德多项式与契贝谢夫多项式之间的一些关系     

Application of the least-squares spectral element method using Chebyshev polynomials to solve the incompressible Navier-Stokes equations

In this paper the extension of the Legendre least-squares spectral element formulation to Chebyshev polynomials will be explained. The new method will be applied to the incompressible Navier-Stokes equations and numerical results, obtained for the lid-driven cavity flow at Reynolds numbers varying between 1000 and 7500, will be compared with the commonly used benchmark results. The new results reveal that the least-squares spectral element formulations based on the Legendre and Chebyshev Gauss-Lobatto Lagrange interpolating polynomials are equally accurate.     

A postprocessed Galerkin method with Chebyshev or Legendre polynomials

Summary. We present an approximate-inertial-manifold-based postprocess to enhance Chebyshev or Legendre spectral Galerkin methods. We prove that the postprocess improves the order of convergence of the Galerkin solution, yielding the same accuracy as the nonlinear Galerkin method. Numerical experiments show that the new method is computationally more efficient than Galerkin and nonlinear Galerkin methods. New approximation results for Chebyshev polynomials are presented. Received January 5, 1998 / Revised version received September 7, 1999 / Published online June 8, 2000     

Multi-variable Hermite matrix polynomials: Properties and applications

In this paper, the multi-variable Hermite matrix polynomials are introduced by algebraic decomposition of exponential operators. Their properties are established using operational methods. The matrix forms of the Chebyshev and truncated polynomials of two variable are also introduced, which are further used to derive certain operational representations and expansion formulae.     

On modified Chebyshev polynomials

In this paper some new properties and applications of modified Chebyshev polynomials and Morgan-Voyce polynomials will be presented. The aim of the paper is to complete the knowledge about all of these types of polynomials.     

Quadrature discretization method in tethered satellite control

A pseudospectral method for solving the tethered satellite retrieval problem based on nonclassical orthogonal and weighted interpolating polynomials is presented. Traditional pseudospectral methods expand the state and control trajectories using global Lagrange interpolating polynomials based on a specific class of orthogonal polynomials from the Jacobi family, such as Legendre or Chebyshev polynomials, which are orthogonal with respect to a specific weight function over a fixed interval. Although these methods have many advantages, the location of the collocation points are more or less fixed. The method presented in this paper generalizes the existing methods and allows a much more flexible selection of grid points by the arbitrary selection of the orthogonal weight function and interval. The trajectory optimization problem is converted to set of algebraic equations by discretization of the necessary conditions using a nonclassical pseudospectral method.     

An efficient algorithm for the multivariable Adomian polynomials

In this article the sum of the series of multivariable Adomian polynomials is demonstrated to be identical to a rearrangement of the multivariable Taylor expansion of an analytic function of the decomposition series of solutions u₁, u₂, … , u_m about the initial solution components u_1,0, u_2,0, … , u_m,0; of course the multivariable Adomian polynomials were developed and are eminently practical for the solution of coupled nonlinear differential equations. The index matrices and their simplified forms of the multivariable Adomian polynomials are introduced. We obtain the recurrence relations for the simplified index matrices, which provide a convenient algorithm for rapid generation of the multivariable Adomian polynomials. Another alternative algorithm for term recurrence is established. In these algorithms recurrence processes do not require complicated operations such as parametrization, expanding and regrouping, derivatives, etc. as practiced in prior art. The MATHEMATICA program generating the Adomian polynomials based on the algorithm in this article is designed.     

The Gibbs phenomenon for series of orthogonal polynomials

This note considers the four classes of orthogonal polynomials – Chebyshev, Hermite, Laguerre, Legendre – and investigates the Gibbs phenomenon at a jump discontinuity for the corresponding orthogonal polynomial series expansions. The perhaps unexpected thing is that the Gibbs constant that arises for each class of polynomials appears to be the same as that for Fourier series expansions. Each class of polynomials has features which are interesting numerically. Finally a plausibility argument is included showing that this phenomenon for the Gibbs constants should not have been unexpected. These findings suggest further investigations suitable for undergraduate research projects or small group investigations.     

一些包含Chebyshev多项式和Stirling数的恒等式

利用初等方法研究Chebyshev多项式的性质,建立了广义第二类Chebyshev多项式的一个显明公式,并得到了一些包含第一类Chebyshev多项式,第一类Stirling数和Lucas数的恒等式.     

Optimization via Chebyshev polynomials

This paper presents for the first time a robust exact line-search method based on a full pseudospectral (PS) numerical scheme employing orthogonal polynomials. The proposed method takes on an adaptive search procedure and combines the superior accuracy of Chebyshev PS approximations with the high-order approximations obtained through Chebyshev PS differentiation matrices. In addition, the method exhibits quadratic convergence rate by enforcing an adaptive Newton search iterative scheme. A rigorous error analysis of the proposed method is presented along with a detailed set of pseudocodes for the established computational algorithms. Several numerical experiments are conducted on one- and multi-dimensional optimization test problems to illustrate the advantages of the proposed strategy.     

A comparison between the reduced differential transform method and the Adomian decomposition method for the Newell–Whitehead–Segel equation

In this paper, we will carry out a comparative study between the reduced differential transform method and the Adomian decomposition method. This is been achieved by handling the Newell–Whitehead–Segel equation. Two numerical examples have also been carried out to validate and demonstrate efficiency of the two methods. Furthermost, it is shown that the reduced differential transform method has an advantage over the Adomian decomposition method that it takes less time to solve the nonlinear problems without using the Adomian polynomials.     

Approximate solution of integral equations and convolution integrals using Legendre polynomials

It has been argued that Chebyshev polynomials are ideal to use as approximating functions to obtain solutions of integral equations and convolution integrals on account of their fast convergence. Using the standard deviation as a measure of the accuracy of the approximation and the CPU time as a measure of the speed, we find that for reasonable accuracy Legendre polynomials are more efficient.     

Use of Adomian decomposition method in the study of parallel plate flow of a third grade fluid

In this paper, Adomian’s decomposition method is used to solve non-linear differential equations which arise in fluid dynamics. We study basic flow problems of a third grade non-Newtonian fluid between two parallel plates separated by a finite distance. The technique of Adomian decomposition is successfully applied to study the problem of a non-Newtonian plane Couette flow, fully developed plane Poiseuille flow and plane Couette–Poiseuille flow. The results obtained show the reliability and efficiency of this analytical method. Numerical solutions are also obtained by solving non-linear ordinary differential equations using Chebyshev spectral method. We present a comparative study between the analytical solutions and numerical solutions. The analytical results are found to be in good agreement with numerical solutions which reveals the effectiveness and convenience of the Adomian decomposition method.     

Application of a composition of generating functions for obtaining explicit formulas of polynomials

Using notions of composita and composition of generating functions, we obtain explicit formulas for the Chebyshev polynomials, the Legendre polynomials, the Gegenbauer polynomials, the Associated Laguerre polynomials, the Stirling polynomials, the Abel polynomials, the Bernoulli Polynomials of the Second Kind, the Generalized Bernoulli polynomials, the Euler Polynomials, the Peters polynomials, and the Narumi polynomials.     

An auxiliary parameter method using Adomian polynomials and Laplace transformation for nonlinear differential equations

In this article, we proposed an auxiliary parameter method using Adomian polynomials and Laplace transformation for nonlinear differential equations. This method is called the Auxiliary Laplace Parameter Method (ALPM). The nonlinear terms can be easily handled by the use of Adomian polynomials. Comparison of the present solution is made with the existing solutions and excellent agreement is noted. The fact that the proposed technique solves nonlinear problems without any discretization or restrictive assumptions can be considered as a clear advantage of this algorithm over the numerical methods.     

Small polynomials with integer coefficients

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials. Their factors, zero distribution and asymptotics are the main subjects of this paper. In particular, we show that the integer Chebyshev polynomials for any infinite subset of the real line must have infinitely many distinct factors, which answers a question of Borwein and Erdélyi. Furthermore, it is proved that the accumulation set for their zeros must be of positive capacity in this case. We also find the first nontrivial examples of explicit integer Chebyshev constants for certain classes of lemniscates. Since it is rarely possible to obtain an exact value of the integer Chebyshev constant, good estimates are of special importance. Introducing the methods of weighted potential theory, we generalize and improve the Hilbert-Fekete upper bound for the integer Chebyshev constant. These methods also give bounds for the multiplicities of factors of integer Chebyshev polynomials, and lower bounds for the integer Chebyshev constant. Moreover, all the bounds mentioned can be found numerically by using various extremal point techniques, such as the weighted Leja points algorithm. Applying our results in the classical case of the segment [0, 1], we improve the known bounds for the integer Chebyshev constant and the multiplicities of factors of the integer Chebyshev polynomials. Research supported in part by the National Security Agency under Grant No. MDA904-03-1-0081.