Mapped barycentric Chebyshev differentiation matrix method for the solution of regular Sturm-Liouville problems

In this paper, using spectral differentiation matrix and an elimination treatment of boundary conditions, Sturm-Liouville problems (SLPs) are discretized into standard matrix eigenvalue problems. The eigenvalues of the original Sturm-Liouville operator are approximated by the eigenvalues of the corresponding Chebyshev differentiation matrix (CDM). This greatly improves the efficiency of the classical Chebyshev collocation method for SLPs, where a determinant or a generalized matrix eigenvalue problem has to be computed. Furthermore, the state-of-the-art spectral method, which incorporates the barycentric rational interpolation with a conformal map, is used to solve regular SLPs. A much more accurate mapped barycentric Chebyshev differentiation matrix (MBCDM) is obtained to approximate the Sturm-Liouville operator. Compared with many other existing methods, the MBCDM method achieves higher accuracy and efficiency, i.e., it produces fewer outliers. When a large number of eigenvalues need to be computed, the MBCDM method is very competitive. Hundreds of eigenvalues up to more than ten digits accuracy can be computed in several seconds on a personal computer.     

The solution of high-order nonlinear ordinary differential equations by Chebyshev Series

By the use of the Chebyshev series, a direct computational method for solving the higher order nonlinear differential equations has been developed in this paper. This method transforms the nonlinear differential equation into the matrix equation, which corresponds to a system of nonlinear algebraic equations with unknown Chebyshev coefficients, via Chebyshev collocation points. The solution of this system yields the Chebyshev coefficients of the solution function. An algorithm for this nonlinear system is also proposed in this paper. The method is valid for both initial-value and boundary-value problems. Several examples are presented to illustrate the accuracy and effectiveness of the method.     

Wavelet analysis method for solving linear and nonlinear singular boundary value problems

In this paper, a robust and accurate algorithm for solving both linear and nonlinear singular boundary value problems is proposed. We introduce the Chebyshev wavelets operational matrix of derivative and product operation matrix. Chebyshev wavelets expansions together with operational matrix of derivative are employed to solve ordinary differential equations in which, at least, one of the coefficient functions or solution function is not analytic. Several examples are included to illustrate the efficiency and accuracy of the proposed method.     

Free vibration of non-uniform Euler–Bernoulli beam under various supporting conditions using Chebyshev wavelet collocation method

This paper proposes operational matrix of rth integration of Chebyshev wavelets. A general procedure of this matrix is given. Operational matrix of rth integration is taken as rth power of operational matrix of first integration in literature. But, this study removes this disadvantage of Chebyshev wavelets method. Free vibration problems of non-uniform Euler–Bernoulli beam under various supporting conditions are investigated by using Chebyshev Wavelet Collocation Method. The proposed method is based on the approximation by the truncated Chebyshev wavelet series. A homogeneous system of linear algebraic equations has been obtained by using the Chebyshev collocation points. The determinant of coefficients matrix is equated to the zero for nontrivial solution of homogeneous system of linear algebraic equations. Hence, we can obtain ith natural frequencies of the beam and the coefficients of the approximate solution of Chebyshev wavelet series that satisfied differential equation and boundary conditions. Mode shapes functions corresponding to the natural frequencies can be obtained by normalizing of approximate solutions. The computed results well fit with the analytical and numerical results as in the literature. These calculations demonstrate that the accuracy of the Chebyshev wavelet collocation method is quite good even for small number of grid points.     

An adaptive Chebyshev iterative method\newline for nonsymmetric linear systems based on modified moments

Summary. Large, sparse nonsymmetric systems of linear equations with a matrix whose eigenvalues lie in the right half plane may be solved by an iterative method based on Chebyshev polynomials for an interval in the complex plane. Knowledge of the convex hull of the spectrum of the matrix is required in order to choose parameters upon which the iteration depends. Adaptive Chebyshev algorithms, in which these parameters are determined by using eigenvalue estimates computed by the power method or modifications thereof, have been described by Manteuffel [18]. This paper presents an adaptive Chebyshev iterative method, in which eigenvalue estimates are computed from modified moments determined during the iterations. The computation of eigenvalue estimates from modified moments requires less computer storage than when eigenvalue estimates are computed by a power method and yields faster convergence for many problems. Received May 13, 1992/Revised version received May 13, 1993     

Chebyshev tau meshless method based on the highest derivative for fourth order equations

It is well known that the numerical integration process is much less sensitive than numerical differential process when dealing with the differential equations. After integration, accuracy is no longer limited by that of the slowly convergent series for the highest derivative, but only by that of the unknown function itself. In this paper, a Chebyshev tau meshless method based on the highest derivative (CTMMHD) is developed for fourth order equations on irregularly shaped domains with complex boundary conditions. The problem domain is embedded in a domain of regular shape. The integration and multiplication of Chebyshev expansions are given in matrix representations. Several numerical experiments including standard biharmonic problems, problems with variable coefficients and nonlinear problems are implemented to verify the high accuracy and efficiency of our method.     

A numerical comparison of Chebyshev methods for solving fourth order semilinear initial boundary value problems

In solving semilinear initial boundary value problems with prescribed non-periodic boundary conditions using implicit-explicit and implicit time stepping schemes, both the function and derivatives of the function may need to be computed accurately at each time step. To determine the best Chebyshev collocation method to do this, the accuracy of the real space Chebyshev differentiation, spectral space preconditioned Chebyshev tau, real space Chebyshev integration and spectral space Chebyshev integration methods are compared in the L² and W^2,2 norms when solving linear fourth order boundary value problems; and in the L^∞([0,T];L²) and L^∞([0,T];W^2,2) norms when solving initial boundary value problems. We find that the best Chebyshev method to use for high resolution computations of solutions to initial boundary value problems is the spectral space Chebyshev integration method which uses sparse matrix operations and has a computational cost comparable to Fourier spectral discretization.     

Chebyshev polynomial approximation for high‐order partial differential equations with complicated conditions

In this article, a new method is presented for the solution of high‐order linear partial differential equations (PDEs) with variable coefficients under the most general conditions. The method is based on the approximation by the truncated double Chebyshev series. PDE and conditions are transformed into the matrix equations, which corresponds to a system of linear algebraic equations with the unknown Chebyshev coefficients, via Chebyshev collocation points. Combining these matrix equations and then solving the system yields the Chebyshev coefficients of the solution function. Some numerical results are included to demonstrate the validity and applicability of the method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Novel Chebyshev wavelets algorithms for optimal control and analysis of general linear delay models

A new efficient type of Chebyshev wavelet is used to find the optimal solutions of general linear, continuous-time, multi-delay systems with quadratic performance indices and also to obtain the responses of linear time-delay systems. According to the new definition of Chebyshev wavelets, the operational matrices of integration, product, delay and inverse time and the integration matrix are derived. Furthermore, new operational matrices as the piecewise delay operational matrix and the stretch operational matrix of the desired Chebyshev wavelets are introduced to analyze systems with, in turn, piecewise constant delays and stretched arguments or proportional delays. Two novel algorithms based on newly Chebyshev wavelet method are proposed for the optimal control and the analysis of delay models. Some examples are solved to establish that the accuracy and applicability of Chebyshev wavelet method in delay systems are increased.     

Efficient approximation of the exponential operator for discrete 2D advection–diffusion problems

In this paper we compare Krylov subspace methods with Faber series expansion for approximating the matrix exponential operator on large, sparse, non‐symmetric matrices. We consider in particular the case of Chebyshev series, corresponding to an initial estimate of the spectrum of the matrix by a suitable ellipse. Experimental results upon matrices with large size, arising from space discretization of 2D advection–diffusion problems, demonstrate that the Chebyshev method can be an effective alternative to Krylov techniques. Copyright © 2002 John Wiley & Sons, Ltd.     

The discrete linear restricted Chebyshev approximation

A numerically stable simplex algorithm for calculating the restricted Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm minimum computer storage is required and no conditions are imposed on the coefficient matrix or on the right hand side of the system of equations. Also a new way of implementing a triangular decomposition method to the basis matrix is used. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions are obtained as special cases in this algorithm. Numerical results are given.     

A new Chebyshev polynomial approximation for solving delay differential equations

The purpose of this study is to give a Chebyshev polynomial approximation for the solution of mth-order linear delay differential equations with variable coefficients under the mixed conditions. For this purpose, a new Chebyshev collocation method is introduced. This method is based on taking the truncated Chebyshev expansion of the function in the delay differential equations. Hence, the resulting matrix equation can be solved, and the unknown Chebyshev coefficients can be found approximately. In addition, examples that illustrate the pertinent features of the method are presented, and the results of this investigation are discussed.     

Preconditioned Spectral Gradient Method

The spectral gradient method is a nonmonotone gradient method for large-scale unconstrained minimization. We strengthen the algorithm by modifications which globalize the method and present strategies to apply preconditioning techniques. The modified algorithm replaces a condition of uniform positive definitness of the preconditioning matrices, with mild conditions on the search directions. The result is a robust algorithm which is effective on very large problems. Encouraging numerical experiments are presented for a variety of standard test problems, for solving nonlinear Poisson-type equations, an also for finding molecular conformations by distance geometry.     

Chebyshev rational matrix approximation with a priori error bounds for linear and Riccati matrix equations

This paper deals with initial value problems for Lipschitz continuous coefficient matrix Riccati equations. Using Chebyshev polynomial matrix approximations the coefficients of the Riccati equation are approximated by matrix polynomials in a constructive way. Then using the Fröbenius method developed in [1], given an admissible error ϵ > 0 and the previously guaranteed existence domain, a rational matrix polynomial approximation is constructed so that the error is less than ϵ in all the existence domain. The approach is also considered for the construction of matrix polynomial approximations of nonhomogeneous linear differential systems avoiding the integration of the transition matrix of the associated homogeneous problem.     

A fast direct algorithm for implementing a high-order finite element method on rectangles as applied to boundary value problems for the Poisson equation

Fast direct and inverse algorithms for expansion in terms of eigenvectors of one-dimensional eigenvalue problems for a high-order finite element method (FEM) are proposed based on the fast discrete Fourier transform. They generalize logarithmically optimal Fourier algorithms for solving boundary value problems for Poisson-type equations on rectangular meshes to high-order FEM. The algorithms can be extended to the multidimensional case and can be applied to nonstationary problems.     

Wavelets method for solving systems of nonlinear singular fractional Volterra integro-differential equations

This paper presents a computational method for solving a class of system of nonlinear singular fractional Volterra integro-differential equations. First, existences of a unique solution for under studying problem is proved. Then, shifted Chebyshev polynomials and their properties are employed to derive a general procedure for forming the operational matrix of fractional derivative for Chebyshev wavelets. The application of this operational matrix for solving mentioned problem is explained. In the next step, the error analysis of the proposed method is investigated. Finally, some examples are included for demonstrating the efficiency of the proposed method.     

A new operational matrix of fractional order integration for the Chebyshev wavelets and its application for nonlinear fractional Van der Pol oscillator equation

In this paper, an efficient and accurate computational method based on the Chebyshev wavelets (CWs) together with spectral Galerkin method is proposed for solving a class of nonlinear multi-order fractional differential equations (NMFDEs). To do this, a new operational matrix of fractional order integration in the Riemann–Liouville sense for the CWs is derived. Hat functions (HFs) and the collocation method are employed to derive a general procedure for forming this matrix. By using the CWs and their operational matrix of fractional order integration and Galerkin method, the problems under consideration are transformed into corresponding nonlinear systems of algebraic equations, which can be simply solved. Moreover, a new technique for computing nonlinear terms in such problems is presented. Convergence of the CWs expansion in one dimension is investigated. Furthermore, the efficiency and accuracy of the proposed method are shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As a useful application, the proposed method is applied to obtain an approximate solution for the fractional order Van der Pol oscillator (VPO) equation.     

Solving fractional nonlinear Fredholm integro-differential equations by the second kind Chebyshev wavelet

In this paper, we first construct the second kind Chebyshev wavelet. Then we present a computational method based on the second kind Chebyshev wavelet for solving a class of nonlinear Fredholm integro-differential equations of fractional order. The second kind Chebyshev wavelet operational matrix of fractional integration is derived and used to transform the equation to a system of algebraic equations. The method is illustrated by applications and the results obtained are compared with the existing ones in open literature. Moreover, comparing the methodology with the known technique shows that the present approach is more efficient and more accurate.     

An extension of the Gegenbauer pseudospectral method for the time fractional Fokker‐Planck equation

The time fractional Fokker‐Planck equation has been used in many physical transport problems which take place under the influence of an external force field. In this paper we examine pseudospectral method based on Gegenbauer polynomials and Chebyshev spectral differentiation matrix to solve numerically a class of initial‐boundary value problems of the time fractional Fokker‐Planck equation on a finite domain. The presented method reduces the main problem to a generalized Sylvester matrix equation, which can be solved by the global generalized minimal residual method. Some numerical experiments are considered to demonstrate the accuracy and the efficiency of the proposed computational procedure.     

Construction of a Mindlin pseudospectral plate element and evaluating efficiency of the element

In this paper, a Mindlin pseudospectral plate element is constructed to perform static, dynamic, and wave propagation analyses of plate-like structures. Chebyshev polynomials are used as basis functions and Chebyshev–Gauss–Lobatto points are used as grid points. Two integration schemes, i.e., Gauss–Legendre quadrature (GLEQ) and Chebyshev points quadrature (CPQ), are employed independently to form the elemental stiffness matrix of the present element. A lumped elemental mass matrix is generated by only using CPQ due to the discrete orthogonality of Chebyshev polynomials and overlapping of the quadrature points with the grid points. This results in a remarkable reduction of numerical operations in solving the equation of motion for being able to use explicit time integration schemes. Numerical calculations are carried out to investigate the influence of the above two numerical integration schemes in the elemental stiffness formation on the accuracy of static and dynamic response analyses. By comparing with the results of ABAQUS, this study shows that CPQ performs slightly better than GLEQ in various plates with different thicknesses, especially in thick plates. Finally, a one dimensional (1D) and a 2D wave propagation problems are used to demonstrate the efficiency of the present Mindlin pseudospectral plate element.