Stokes eigenmodes in square domain and the stream function-vorticity correlation
Journal of Computational Physics
An efficient direct parallel spectral-element solver for separable elliptic problems
Journal of Computational Physics
Fast Tensor-Product Solvers: Partially Deformed Three-dimensional Domains
Journal of Scientific Computing
Matrix decomposition algorithms for elliptic boundary value problems: a survey
Numerical Algorithms
Spectral Chebyshev Collocation for the Poisson and Biharmonic Equations
SIAM Journal on Scientific Computing
Journal of Computational Physics
A fourth order finite difference method for the Dirichlet biharmonic problem
Numerical Algorithms
Hi-index | 0.03 |
We show that one can derive an $O(N^3)$ spectral-Galerkin method for fourth-order (biharmonic type) elliptic equations based on the use of Chebyshev polynomials. The use of Chebyshev polynomials provides a fast transform between physical and spectral space which is advantageous when a sequence of problems must be solved, e.g., as part of a nonlinear iteration. This improves the result of Shen [SIAM J. Sci. Comput., 16 (1995), pp. 74--87] which reported an $O(N^4)$ algorithm inferior to the $O(N^3)$ method developed earlier [Shen, SIAM J. Sci. Comput., 15 (1994), pp. 1440--1451] based on Legendre polynomials but less practical in the case of multiple problems. We further compare our method with an improved implementation of the Legendre--Galerkin method based on the same approach.