Convergence of spectral methods for hyperbolic initial-boundary value systems

A convergence proof for spectral approximations is presented for hyperbolic systems with initial and boundary conditions. The Chebyshev collocation is treated in detail, but the final result is readily applicable to other spectral methods, such as Legendre collocation or tau-methods

On hphp-Convergence of PSWFs and A New Well-Conditioned Prolate-Collocation Scheme

The first purpose of this paper is to provide a rigorous proof for the nonconvergence of $h$-refinement in $hp$-approximation by the PSWFs, a surprising convergence property that was first observed by Boyd et al [J. Sci. Comput., 2013]. The second purpose is to offer a new basis that leads to spectral-collocation systems with condition numbers independent of $(c,N),$ the intrinsic bandwidth parameter and the number of collocation points. In addition, this work gives insights into the development of effective spectral algorithms using this non-polynomial basis. We in particular highlight that the collocation scheme together with a very practical rule for pairing up $(c,N)$ significantly outperforms the Legendre polynomial-based method (and likewise other Jacobi polynomial-based method) in approximating highly oscillatory bandlimited functions.Comment: 23 pages, 17 figure

Optimal Collocation Nodes for Fractional Derivative Operators

Spectral discretizations of fractional derivative operators are examined, where the approximation basis is related to the set of Jacobi polynomials. The pseudo-spectral method is implemented by assuming that the grid, used to represent the function to be differentiated, may not be coincident with the collocation grid. The new option opens the way to the analysis of alternative techniques and the search of optimal distributions of collocation nodes, based on the operator to be approximated. Once the initial representation grid has been chosen, indications on how to recover the collocation grid are provided, with the aim of enlarging the dimension of the approximation space. As a results of this process, performances are improved. Applications to fractional type advection-diffusion equations, and comparisons in terms of accuracy and efficiency are made. As shown in the analysis, special choices of the nodes can also suggest tricks to speed up computations

A spectral collocation technique based on integrated Chebyshev polynomials for biharmonic problems in irregular domains

In this paper, an integral collocation approach based on Chebyshev polynomials for numerically solving biharmonic equations [N. Mai-Duy, R.I. Tanner, A spectral collocation method based on integrated Chebyshev polynomials for biharmonic boundary-value problems, J. Comput. Appl. Math. 201 (1) (2007) 30–47] is further developed for the case of irregularly shaped domains. The problem domain is embedded in a domain of regular shape, which facilitates the use of tensor product grids. Two relevant important issues, namely the description of the boundary of the domain on a tensor product grid and the imposition of double boundary conditions, are handled effectively by means of integration constants. Several schemes of the integral collocation formulation are proposed, and their performances are numerically investigated through the interpolation of a function and the solution of 1D and 2D biharmonic problems. Results obtained show that they yield spectral accuracy

Spectral collocation methods

This review covers the theory and application of spectral collocation methods. Section 1 describes the fundamentals, and summarizes results pertaining to spectral approximations of functions. Some stability and convergence results are presented for simple elliptic, parabolic, and hyperbolic equations. Applications of these methods to fluid dynamics problems are discussed in Section 2

Domain decomposition preconditioners for the spectral collocation method

Several block iteration preconditioners are proposed and analyzed for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate which does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism

Numerical solution for elliptic interface problems using spectral element collocation method

The aim of this paper is to solve an elliptic interface problem with a discontinuous coefficient and a singular source term by the spectral collocation method. First, we develop an algorithm for the elliptic interface problem defined in a rectangular domain with a line interface. By using the Gordon-Hall transformation, we generalize it to a domain with a curve boundary and a curve interface. The spectral element collocation method is then employed to complex geometries; that is, we decompose the domain into some nonoverlaping subdomains and the spectral collocation solution is sought in each subdomain. We give some numerical experiments to show efficiency of our algorithm and its spectral convergence.open0