Efficient Spectral-Galerkin Method I. Direct Solvers of Second- and Fourth-Order Equations Using Legendre Polynomials
SIAM Journal on Scientific Computing1994Vol. 15(6), pp. 1489–1505
Citations Over TimeTop 10% of 1994 papers
Abstract
This paper presents some efficient algorithms based on the Legendre–Galerkin approximations for the direct solution of the second- and fourth-order elliptic equations. The key to the efficiency of these algorithms is to construct appropriate base functions, which lead to systems with sparse matrices for the discrete variational formulations. The complexities of the algorithms are a small multiple of $N^{d + 1} $ operations for a d-dimensional domain with $(N - 1)^d $ unknowns, while the convergence rates of the algorithms are exponential for problems with smooth solutions. In addition, the algorithms can be effectively parallelized since the bottlenecks of the algorithms are matrix-matrix multiplications.
Related Papers
- → Efficient Legendre moment computation for grey level images(2005)48 cited
- → Image analysis with symmetry properties of Legendre moments(2017)3 cited
- A Novel Algorithm for Fast Computing Legendre Moments of Gray-Level Images(2004)
- An Efficient Method of Computation of Legendre Moments(2000)