THE ACCURACY COMPARISON BETWEEN CHEBYSHEV-τ METHOD AND CHEBYSHEV COLLOCATION METHOD

This paper is devoted to investigate the accuracy of the Pseudo spectral scheme with the Chebyshev tau method and Chebyshev collocation method. The computational results of the nonlinear disturbance development in plane Poiseuille flow for both methods are presented and compared in detail. It is acknowledged that the Chebyshev collocation method has higher precision than the other one, especially for near netural situation.

CHEBYSHEV METHODS WITH DISCRETE NOISE:THE T-ROCK METHODS

Stabilized or Chebyshev explicit methods have been widely used in the past to solve stiff ordinary differential equations. Making use of special properties of Chebyshev-like polynomials, these methods have favorable stability properties compared to standard explicit methods while remaining explicit. A new class of such methods, called ROCK, introduced in [Numer. Math., 90, 1-18, 2001] has recently been extended to stiff stochastic differential equations under the name S-ROCK [C. R. Acad. Sci. Paris, 345（10）, 2007 and Commun. Math. Sci, 6（4）, 2008]. In this paper we discuss the extension of the S-ROCK methods to systems with discrete noise and propose a new class of methods for such problems, the τ-ROCK methods. One motivation for such methods is the simulation of multi-scale or stiff chemical kinetic systems and such systems are the focus of this paper, but our new methods could potentially be interesting for other stiff systems with discrete noise. Two versions of the τ-ROCK methods are discussed and their stability behavior is analyzed on a test problem. Compared to the τ-leaping method, a significant speed-up can be achieved for some stiff kinetic systems. The behavior of the proposed methods are tested on several numerical experiments.

Dynamic analysis of beam-cable coupled systems using Chebyshev spectral element method

The dynamic characteristics of a beam-cable coupled system are investigated using an improved Chebyshev spectral element method in order to observe the effects of adding cables on the beam. The system is modeled as a double Timoshenko beam system interconnected by discrete springs. Utilizing Chebyshev series expansion and meshing the system according to the locations of its connections, numerical results of the natural frequencies and mode shapes are obtained using only a few elements, and the results are validated by comparing them with the results of a finite-element method. Then the effects of the cable parameters and layout of connections on the natural frequencies and mode shapes of a fixed-pinned beam are studied. The results show that the modes of a beam-cable coupled system can be classified into two types, beam mode and cable mode, according to the dominant deformation. To avoid undesirable vibrations of the cable, its parameters should be controlled in a reasonable range, or the layout of the connections should be optimized.

A lumped mass Chebyshev spectral element method and its application to structural dynamic problems

A diagonal or lumped mass matrix is of great value for time-domain analysis of structural dynamic and wave propagation problems,as the computational efforts can be greatly reduced in the process of mass matrix inversion.In this study,the nodal quadrature method is employed to construct a lumped mass matrix for the Chebyshev spectral element method(CSEM).A Gauss-Lobatto type quadrature,based on Gauss-Lobatto-Chebyshev points with a weighting function of unity,is thus derived.With the aid of this quadrature,the CSEM can take advantage of explicit time-marching schemes and provide an efficient new tool for solving structural dynamic problems.Several types of lumped mass Chebyshev spectral elements are designed,including rod,beam and plate elements.The performance of the developed method is examined via some numerical examples of natural vibration and elastic wave propagation,accompanied by their comparison to that of traditional consistent-mass CSEM or the classical finite element method(FEM).Numerical results indicate that the proposed method displays comparable accuracy as its consistent-mass counterpart,and is more accurate than classical FEM.For the simulation of elastic wave propagation in structures induced by high-frequency loading,this method achieves satisfactory performance in accuracy and efficiency.

Simulation of electrically driven jet using Chebyshev collocation method

The model of electrically driven jet is governed by a series of quasi 1D dimensionless partial differential equations(PDEs).Following the method of lines,the Chebyshev collocation method is employed to discretize the PDEs and obtain a system of differential-algebraic equations(DAEs).By differentiating constrains in DAEs twice,the system is transformed into a set of ordinary differential equations(ODEs) with invariants.Then the implicit differential equations solver 'ddaskr' is used to solve the ODEs and post-stabilization is executed at the end of each step.Results show the distributions of radius,linear charge density,stretching ratio and also the horizontal velocity at a time point.Meanwhile,the spiral and expanding projections to X-Y plane of the jet centerline suggest the occurring of bending instability.

ON A FAMILY OF CHEBYSHEV-HALLEY TYPE METHODS IN BANACH SPACE UNDER WEAKER SMALE CONDITION

In this paper, we discuss local convergence of a family of Chebychev Halley type methods with a parameter θ∈[0,1] in Banach space using Smale type δ criterion under 2 th γ condition. We will see that the properties of the condition used for local convergence is much more different from that used in [6][15] for the semi-local convergence.

Chebyshev Pseudo-Spectral Method for Solving Fractional Advection-Dispersion Equation

Fractional differential equations have recently been applied in various areas of engineering, science, finance, applied mathematics, bio-engineering and others. However, many researchers remain unaware of this field. In this paper, an efficient numerical method for solving the fractional Advection-dispersion equation (ADE) is considered. The fractional derivative is described in the Caputo sense. The method is based on Chebyshev approximations. The properties of Chebyshev polynomials are used to reduce ADE to a system of ordinary differential equations, which are solved using the finite difference method (FDM). Moreover, the convergence analysis and an upper bound of the error for the derived formula are given. Numerical solutions of ADE are presented and the results are compared with the exact solution.

The Lanczos-Chebyshev Pseudospectral Method for Solution of Differential Equations

In this paper, we propose to replace the Chebyshev series used in pseudospectral methods with the equivalent Chebyshev economized power series that can be evaluated more rapidly. We keep the rest of the implementation the same as the spectral method so that there is no new mathematical principle involved. We show by numerical examples that the new approach works well and there is indeed no significant loss of solution accuracy. The advantages of using power series also include simplicity in its formulation and implementation such that it could be used for complex systems. We investigate the important issue of collocation point selection. Our numerical results indicate that there is a clear accuracy advantage of using collocation points corresponding to roots of the Chebyshev polynomial.

Optimal control of attitude for coupled-rigid-body spacecraft via Chebyshev-Gauss pseudospectral method

The attitude optimal control problem （OCP） of a two-rigid-body space- craft with two rigid bodies coupled by a ball-in-socket joint is considered. Based on conservation of angular momentum of the system without the external torque, a dynamic equation of three-dimensional attitude motion of the system is formulated. The attitude motion planning problem of the coupled-rigid-body spacecraft can be converted to a dis- crete nonlinear programming （NLP） problem using the Chebyshev-Gauss pseudospectral method （CGPM）. Solutions of the NLP problem can be obtained using the sequential quadratic programming （SQP） algorithm. Since the collocation points of the CGPM are Chebyshev-Gauss （CG） points, the integration of cost function can be approximated by the Clenshaw-Curtis quadrature, and the corresponding quadrature weights can be calculated efficiently using the fast Fourier transform （FFT）. To improve computational efficiency and numerical stability, the barycentric Lagrange interpolation is presented to substitute for the classic Lagrange interpolation in the approximation of state and con- trol variables. Furthermore, numerical float errors of the state differential matrix and barycentric weights can be alleviated using trigonometric identity especially when the number of CG points is large. A simple yet efficient method is used to avoid sensitivity to the initial values for the SQP algorithm using a layered optimization strategy from a feasible solution to an optimal solution. Effectiveness of the proposed algorithm is perfect for attitude motion planning of a two-rigid-body spacecraft coupled by a ball-in-socket joint through numerical simulation.

MHD Falkner-Skan flow of Maxwell fluid by rational Chebyshev collocation method

The magnetohydrodynamics （MHD） Falkner-Skan flow of the Maxwell fluid is studied. Suitable transform reduces the partial differential equation into a nonlinear three order boundary value problem over a semi-infinite interval. An efficient approach based on the rational Chebyshev collocation method is performed to find the solution to the proposed boundary value problem. The rational Chebyshev collocation method is equipped with the orthogonal rational Chebyshev function which solves the problem on the semi-infinite domain without truncating it to a finite domain. The obtained results are presented through the illustrative graphs and tables which demonstrate the affectivity, stability, and convergence of the rational Chebyshev collocation method. To check the accuracy of the obtained results, a numerical method is applied for solving the problem. The variations of various embedded parameters into the problem are examined.

On Discrete Adomian Decomposition Method with Chebyshev Abscissa for Nonlinear Integral Equations of Hammerstein Type

We study approximate solutions of a nonlinear integral equation of Hammerstein type. We describe the principle of discrete Adomian decomposition method (DADM). DADM is considered in the case we evaluate numerical integration by using Chebyshev roots. This technique gives an accurate solutions as will shown by illustrate examples.

CHEBYSHEV PSEUDOSPECTRAL DOMAIN DECOMPOSITION METHOD OF ONE－DIMENSIONAL ELLIPTIC PROBLEMS

This paper is devoted to the Chebyshev pseudospectral domain decomposition method of one-dimensional elliptic problems,it is easily applied to complex geometry.The approximate accuracy can be increased by increasing the order of approximation in fixed number of subdomains,rather than by resorting to a further partitioning.The stability and the convergence of this method are proved.

ANALYSIS OF CHEBYSHEV PSEUDOSPECTRAL METHOD FOR MULTI-DIMENSIONAL GENERALIZED SRLW EQUATIONS

The Chebyshev pseudospectral approximation of the homogeneous initial boundary value problem for a class of multi-dimensional generalized symmetric regularized long wave (SRLW) equations is considered. The fully discrete Chebyshev pseudospectral scheme is constructed. The convergence of the approximation solution and the optimum error of approximation solution are obtained.

A Method for Solving Fredholm Integral Equations of the First Kind Based on Chebyshev Wavelets

In this paper, we suggest a method for solving Fredholm integral equation of the first kind based on wavelet basis. The continuous Legendre and Chebyshev wavelets of the first, second, third and fourth kind on [0,1] are used and are utilized as a basis in Galerkin method to approximate the solution of integral equations. Then, in some examples the mentioned wavelets are compared with each other.

THE CHEBYSHEV PSEUDOSPECTRAL DOMAIN DECOMPO SITION METHOD FOR SOLVING TWO-DIMENSIONAL ELLIPTIC EQUATION

This paper ix devoted to establishment of the Chebyshev pseudospectral domain de-composition scheme for solving two-dimensional elliptic equation. By the generalized equivalent variatiunal form, we can get the stability and convergence of this new scheme.

AN ACCURATE SOLUTION OF THE POISSON EQUATION BY THE FINITE DIFFERENCE-CHEBYSHEV-TAU METHOD

A new finite difference-Chebyshev-Tau method for the solution of the two-dimensional Poisson equation is presented. Some of the numerical results are also presented which indicate that the method is satisfactory and compatible to other methods.

Subdomain Chebyshev Spectral Method for 2D and 3D Numerical Differentiations in a Curved Coordinate System

A new numerical approach, called the “subdomain Chebyshev spectral method” is presented for calculation of the spatial derivatives in a curved coordinate system, which may be employed for numerical solutions of partial differential equations defined in a 2D or 3D geological model. The new approach refers to a “strong version” against the “weak version” of the subspace spectral method based on the variational principle or Galerkin’s weighting scheme. We incorporate local nonlinear transformations and global spline interpolations in a curved coordinate system and make the discrete grid exactly matches geometry of the model so that it is achieved to convert the global domain into subdomains and apply Chebyshev points to locally sampling physical quantities and globally computing the spatial derivatives. This new approach not only remains exponential convergence of the standard spectral method in subdomains, but also yields a sparse assembled matrix when applied for the global domain simulations. We conducted 2D and 3D synthetic experiments and compared accuracies of the numerical differentiations with traditional finite difference approaches. The results show that as the points of differentiation vector are larger than five, the subdomain Chebyshev spectral method significantly improve the accuracies of the finite difference approaches.

Chebyshev-Legendre method for discretizing optimal control problems

In this paper, a numerical method for solving the optimal control （OC） problems is presented. The method is enlightened by the Chebyshev-Legendre （CL） method for solving the partial differential equations （PDEs）. The Legendre expansions are used to approximate both the control and the state functions. The constraints are discretized over the Chebyshev-Gauss-Lobatto （CGL） collocation points. A Legendre technique is used to approximate the integral involved in the performance index. The OC problem is changed into an equivalent nonlinear programming problem which is directly solved. The fast Legendre transform is employed to reduce the computation time. Several further illustrative examples demonstrate the efficiency of the proposed method.

Two-Level Block Decompositions for Solving Helmholtz Equation via Chebyshev Pseudo Spectral Method

In this paper, we consider solving the Helmholtz equation in the Cartesian domain , subject to homogeneous Dirichlet boundary condition, discretized with the Chebyshev pseudo-spectral method. The main purpose of this paper is to present the formulation of a two-level decomposition scheme for decoupling the linear system obtained from the discretization into independent subsystems. This scheme takes advantage of the homogeneity property of the physical problem along one direction to reduce a 2D problem to several 1D problems via a block diagonalization approach and the reflexivity property along the second direction to decompose each of the 1D problems to two independent subproblems using a reflexive decomposition, effectively doubling the number of subproblems. Based on the special structure of the coefficient matrix of the linear system derived from the discretization and a reflexivity property of the second-order Chebyshev differentiation matrix, we show that the decomposed submatrices exhibits a similar property, enabling the system to be decomposed using reflexive decompositions. Explicit forms of the decomposed submatrices are derived. The decomposition not only yields more efficient algorithm but introduces coarse-grain parallelism. Furthermore, it preserves all eigenvalues of the original matrix.