On the numerical treatment of the eigenparameter dependent boundary conditions

In this paper, we consider the numerical treatment of singular eigenvalue problems supplied with eigenparameter dependent boundary conditions using spectral methods. On the one hand, such boundary conditions hinder the construction of test and trial space functions which could incorporate them and thus providing well-conditioned Galerkin discretization matrices. On the other hand, they can generate surprising behavior of the eigenvectors hardly detected by analytic methods. These singular problems are often indirectly approximated by regular ones. We argue that spectral collocation as well as tau method offer remedies for the first two issues and provide direct and efficient treatment to such problems. On a finite domain, we consider the so-called Petterson-König’s rod eigenvalue problem and on the half line, we take into account the Charney’s baroclinic stability problem and the Fourier eigenvalue problem. One boundary condition in these problems depends on the eigenparameter and additionally, this also could depend on some physical parameters. The Chebyshev collocation based on both, square and rectangular differentiation and a Chebyshev tau method are used to discretize the first problem. All these schemes cast the problems into singular algebraic generalized eigenvalue ones which are solved by the QZ and/or Arnoldi algorithms as well as by some target oriented Jacobi-Davidson methods. Thus, the spurious eigenvalues are completely eliminated. The accuracy of square Chebyshev collocation is roughly estimated and its order of approximation with respect to the eigenvalue of interest is determined. For the problems defined on the half line, we make use of the Laguerre-Gauss-Radau collocation. The method proved to be reliable, accurate, and stable with respect to the order of approximation and the scaling parameter.     

A numerical study for the KdV and the good Boussinesq equations using Fourier Chebyshev tau meshless method

The current paper presents a scheme, which combines Fourier spectral method and Chebyshev tau meshless method based on the highest derivative (CTMMHD) to solve the nonlinear KdV equation and the good Boussinesq equation. Fourier spectral method is used to approximate the spatial variable, and the problem is converted to a series of equations with Fourier coefficients as unknowns. Then, CTMMHD is applied blockwise in time direction. For the long time computing of solitons, we introduce the computational area moving technique. The numerical results show that the accuracy of Fourier-CTMMHD is good and the computational area moving technique makes the long-time numerical behavior well for the problems with solitons moving towards the same direction.     

Analytical and numerical solutions to an electrohydrodynamic stability problem

A linear hydrodynamic stability problem corresponding to an electrohydrodynamic convection between two parallel walls is considered. The problem is an eighth order eigenvalue one supplied with hinged boundary conditions for the even derivatives up to sixth order. It is first solved by a direct analytical method. By variational arguments it is shown that its smallest eigenvalue is real and positive. The problem is cast into a second order differential system supplied only with Dirichlet boundary conditions. Then, two classes of methods are used to solve this formulation of the problem, namely, analytical methods (based on series of Chandrasekar-Galerkin type and of Budiansky-DiPrima type) and spectral methods (tau, Galerkin and collocation) based on Chebyshev and Legendre polynomials. For certain values of the physical parameters the numerically computed eigenvalues from the low part of the spectrum are displayed in a table. The Galerkin and collocation results are fairly closed and confirm the analytical results.     

Spectral homotopy analysis method and its convergence for solving a class of nonlinear optimal control problems

A combination of the hybrid spectral collocation technique and the homotopy analysis method is used to construct an iteration algorithm for solving a class of nonlinear optimal control problems (NOCPs). In fact, the nonlinear two-point boundary value problem (TPBVP), derived from the Pontryagin’s Maximum Principle (PMP), is solved by spectral homotopy analysis method (SHAM). For the first time, we present here a convergence proof for SHAM. We treat in detail Legendre collocation and Chebyshev collocation. It is indicated that Legendre collocation gives the same numerical results with Chebyshev collocation. Comparisons are made between SHAM, Matlab bvp4c generated results and results from literature such as homotopy perturbation method (HPM), optimal homotopy perturbation method (OHPM) and differential transformations.     

DFT modal analysis of spectral element methods for the 2D elastic wave equation

The DFT modal analysis is a dispersion analysis technique that transforms the equations of a numerical scheme to the discrete Fourier transform domain sampled in the mesh nodes. This technique provides a natural matching of exact and approximate modes of propagation. We extend this technique to spectral element methods for the 2D isotropic elastic wave equation, by using a Rayleigh quotient approximation of the eigenvalue problem that characterizes the dispersion relation, taking full advantage of the tensor product representation of the spectral element matrices. Numerical experiments illustrate the dependence of dispersion errors on the grid resolution, polynomial degree, and discretization in time. We consider spectral element methods with Chebyshev and Legendre collocation points.     

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‐Legendre spectral method for solving the two‐dimensional vorticity equations with homogeneous Dirichlet conditions

The Chebyshev‐Legendre spectral method for the two‐dimensional vorticity equations is considered. The Legendre Galerkin Chebyshev collocation method is used with the Chebyshev‐Gauss collocation points. The numerical analysis results under the L²‐norm for the Chebyshev‐Legendre method of one‐dimensional case are generalized into that of the two‐dimensional case. The stability and optimal order convergence of the method are proved. Numerical results are given. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem

A direct solver for the Legendre tau approximation for the two dimensional Poisson problem is proposed. Using the factorization of symmetric eigenvalue problem, the algorithm overcomes the weak points of the Schur decomposition and the conventional diagonalization techniques for the Legendre tau approximation. The convergence of the method is proved and numerical results are presented.     

The operational matrix of fractional integration for shifted Chebyshev polynomials

A new shifted Chebyshev operational matrix (SCOM) of fractional integration of arbitrary order is introduced and applied together with spectral tau method for solving linear fractional differential equations (FDEs). The fractional integration is described in the Riemann–Liouville sense. The numerical approach is based on the shifted Chebyshev tau method. The main characteristic behind the approach using this technique is that only a small number of shifted Chebyshev polynomials is needed to obtain a satisfactory result. Illustrative examples reveal that the present method is very effective and convenient for linear multi-term FDEs.     

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.     

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.     

A Legendre–Galerkin Chebyshev collocation method for the Burgers equation with a random perturbation on boundary condition

In the paper, we apply the generalized polynomial chaos expansion and spectral methods to the Burgers equation with a random perturbation on its left boundary condition. Firstly, the stochastic Galerkin method combined with the Legendre–Galerkin Chebyshev collocation scheme is adopted, which means that the original equation is transformed to the deterministic nonlinear equations by the stochastic Galerkin method and the Legendre–Galerkin Chebyshev collocation scheme is used to deal with the resulting nonlinear equations. Secondly, the stochastic Legendre–Galerkin Chebyshev collocation scheme is developed for solving the stochastic Burgers equation; that is, the stochastic Legendre–Galerkin method is used to discrete the random variable meanwhile the nonlinear term is interpolated through the Chebyshev–Gauss points. Then a set of deterministic linear equations can be obtained, which is in contrast to the other existing methods for the stochastic Burgers equation. The mean square convergence of the former method is analyzed. Numerical experiments are performed to show the effectiveness of our two methods. Both methods provide alternative approaches to deal with the stochastic differential equations with nonlinear terms.     

A new formula for fractional integrals of Chebyshev polynomials: Application for solving multi-term fractional differential equations

A new explicit formula for the integrals of shifted Chebyshev polynomials of any degree for any fractional-order in terms of shifted Chebyshev polynomials themselves is derived. A fast and accurate algorithm is developed for the solution of linear multi-order fractional differential equations (FDEs) by considering their integrated forms. The shifted Chebyshev spectral tau (SCT) method based on the integrals of shifted Chebyshev polynomials is applied to construct the numerical solution for such problems. The method is then tested on examples. It is shown that the SCT yields better results.     

A quadrature tau method for fractional differential equations with variable coefficients

In this article, we develop a direct solution technique for solving multi-order fractional differential equations (FDEs) with variable coefficients using a quadrature shifted Legendre tau (Q-SLT) method. The spatial approximation is based on shifted Legendre polynomials. A new formula expressing explicitly any fractional-order derivatives of shifted Legendre polynomials of any degree in terms of shifted Legendre polynomials themselves is proved. Extension of the tau method for FDEs with variable coefficients is treated using the shifted Legendre–Gauss–Lobatto quadrature. Numerical results are given to confirm the reliability of the proposed method for some FDEs with variable coefficients.     

Bernstein Polynomial Collocation Method for Elliptic Boundary Value Problems

We present a summary of recent developments in application of Bernstein polynomials to solution of elliptic boundary value problems with a pseudospectral method. Solution is approximated using Benstein polynomial interpolant defined at points of the extrema of Chebyshev polynomials i.e. the Chebyshev-Gauss-Lobatto (CGL) nodes. This approach brings impovement comparing to the Bernstein interpolation at equidistant nodes we used previously [1]. We show that this approach leads to spectral convergence and accuracy comparable to that of pseudospectral methods with orthogonal polynomials (Chebyshev, Legendre). The algorithm is implemented in open source library bernstein-poly , which is available online. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On error estimates for Galerkin spectral discretizations of parabolic problems with nonsmooth initial data

We analyze the Legendre and Chebyshev spectral Galerkin semidiscretizations of a one dimensional homogeneous parabolic problem with nonconstant coefficients. We present error estimates for both smooth and nonsmooth data. In the Chebyshev case a limit in the order of approximation is established. On the contrary, in the Legendre case we find an arbitrary high order of convegence.

     

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     

CHEBYSHEV WEIGHTED NORM LEAST-SQUARES SPECTRAL METHODS FOR THE ELLIPTIC PROBLEM

We develop and analyze a first-order system least-squares spectral method for the second-order elhptic boundary value problem with variable coefficients. We first analyze the Chebyshev weighted norm least-squares functional defined by the sum of the Lw^2- and Hw^-1- norm of the residual equations and then we eplace the negative norm by the discrete negative norm and analyze the discrete Chebyshev weighted least-squares method. The spectral convergence is derived for the proposed method. We also present various numerical experiments. The Legendre weighted least-squares method can be easily developed by following this paper.     

线性变系数中立型变延迟微分方程谱方法的收敛性

本文主要研究了应用谱方法求解线性变系数中立型变延迟微分方程,构造了相应的基于Chebyshev和Legendre正交多项式的数值方法, 证明了其收敛性,最后给出了数值算例. 这些结果表明应用谱方法求解延迟微分方程可以获得谱收敛与谱精度的计算效果.