In the spectral solution of 3-D Poisson equations in cylindrical and spherical coordinates including the axis or the center, it is convenient to employ radial basis functions that depend on the Fourier wavenumber or on the latitudinal mode. This idea has been adopted by Matsushima and Marcus and by Verkley for planar problems and pursued by the present authors for spherical ones. For the Dirichlet boundary value problem in both geometries, original bases have been introduced built upon Jacobi polynomials which lead to a purely diagonal representation of the radial second-order differential operator of all spectral modes. This note details the origin of such a diagonalization which extends to cylindrical and spherical regions the properties of the Legendre basis introduced by Jie Shen for Cartesian domains. Closed form expressions are derived for the diagonal elements of the stiffness matrices as well as for the elements of the tridiagonal mass matrices occurring in evolutionary problems. Furthermore, the bound on the condition number of the spectral matrices associated with the Helmholtz equation are determined, proving in a rigorous way one of the main advantages of the proposed radial bases.

The three-dimensional spherical polytropic Lane-Emden problem is yrr + (2/r)yr + ym = 0, y(0) = 1, yr(0) = 0 where m ϵ [0,5] is a constant parameter. The domain is r ϵ [0, ξ] where ξ is the first root of y(r). We recast this as a nonlinear eigenproblem, with three boundary conditions and ξ as the eigenvalue allowing imposition of the extra boundary condition, by making the change of coordinate x ≡ r/ξ: yxx + (2/x)yx + ξ2ym = 0, y(0) = 1, yx(0) = 0, y(1) = 0. We find that a Newton-Kantorovich iteration always converges from an m-independent starting point y(0)(x) = cos([π/2]x), ξ(0) = 3. We apply a Chebyshev pseudospectral method to discretize x. The Lane-Emden equation has branch point singularities at the endpoint x = 1 whenever m is not an integer; we show that the Chebyshev coefficients are an ~ constant/n2m+5 as n → ∞. However, a Chebyshev truncation of N = 100 always gives at least ten decimal places of accuracy — much more accuracy when m is an integer. The numerical algorithm is so simple that the complete code (in Maple) is given as a one page table.

A triangular spectral method for the Stokes equations is developed in this paper. The main contributions are two-fold: First of all, a spectral method using the rational approximation is constructed and analyzed for the Stokes equations in a triangular domain. The existence and uniqueness of the solution, together with an error estimate for the velocity, are proved. Secondly, a nodal basis is constructed for the efficient implementation of the method. These new basis functions enjoy the fully tensorial product property as in a tensor-produce domain. The new triangular spectral method makes it easy to treat more complex geometries in the classical spectral-element framework, allowing us to use arbitrary triangular and tetrahedral elements.

In this paper, we investigate a priori error estimates for the quadratic optimal control problems governed by semilinear elliptic partial differential equations using higher order triangular mixed finite element methods. The state and the co-state are approximated by the order k Raviart-Thomas mixed finite element spaces and the control is approximated by piecewise polynomials of order k (k ≥ 0). A priori error estimates for the mixed finite element approximation of semilinear control problems are obtained. Finally, we present some numerical examples which confirm our theoretical results.

We present a systematic and efficient Chebyshev spectral method using quasi-inverse technique to directly solve the second order equation with the homogeneous Robin boundary conditions and the fourth order equation with the first and second boundary conditions. The key to the efficiency of the method is to multiply quasi-inverse matrix on both sides of discrete systems, which leads to band structure systems. We can obtain high order accuracy with less computational cost. For multi-dimensional and more complicated linear elliptic PDEs, the advantage of this methodology is obvious. Numerical results indicate that the spectral accuracy is achieved and the proposed method is very efficient for 2-D high order problems.

This work is to provide general spectral and pseudo-spectral Jacobi-Petrov-Galerkin approaches for the second kind Volterra integro-differential equations. The Gauss-Legendre quadrature formula is used to approximate the integral operator and the inner product based on the Jacobi weight is implemented in the weak formulation in the numerical implementation. For some spectral and pseudo-spectral Jacobi-Petrov-Galerkin methods, a rigorous error analysis in both and L∞ norms is given provided that both the kernel function and the source function are sufficiently smooth. Numerical experiments validate the theoretical prediction.

In this paper, we present an efficient time-splitting Fourier spectral method for the quintic complex Swift-Hohenberg equation. Using the Strang time-splitting technique, we split the equation into linear part and nonlinear part. The linear part is solved with Fourier Pseudospectral method; the nonlinear part is solved analytically. We show that the method is easy to be applied and second-order in time and spectrally accurate in space. We apply the method to investigate soliton propagation, soliton interaction, and generation of stable moving pulses in one dimension and stable vortex solitons in two dimensions.

The aim of this paper is to develop the mixed spectral and pseudospectral methods for nonlinear problems outside a disc, using Fourier and generalized Laguerre functions. As an example, we consider a nonlinear strongly damped wave equation. The mixed spectral and pseudospectral schemes are proposed. The convergence is proved. Numerical results demonstrate the efficiency of this approach.

We propose a collocation method for solving initial value problems of second-order ODEs by using modified Laguerre functions. This new process provides global numerical solutions. Numerical results demonstrate the efficiency of the proposed algorithm.

We introduce a family of orthogonal functions, termed as generalized Slepian functions (GSFs), closely related to the time-frequency concentration problem on a unit disk in D. Slepian [19]. These functions form a complete orthogonal system in with , and can be viewed as a generalization of the Jacobi polynomials with parameter (α, 0). We present various analytic and asymptotic properties of GSFs, and study spectral approximations by such functions.