Efficient spectral-Galerkin algorithms for direct solution of fourth-order differential equations using Jacobi polynomials

Authors:
E. H. Doha;A. H. Bhrawy
Affiliations:
Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt;Department of Mathematics, Faculty of Science, Beni-Suef University, Beni-Suef, Egypt
Venue:
Applied Numerical Mathematics
Year:
2008

Citing 12
Cited 9

Collocation and full multigrid methods

Applied Mathematics and Computation
Line relaxation for spectral multigrid methods

Journal of Computational Physics
Efficient direct methods for solving the spectral collocation equations for stokes flow in rectangularly decomposable domains

SIAM Journal on Scientific and Statistical Computing
Spectral collocation methods for Stokes flow in contraction geometries and unbounded domains

Journal of Computational Physics
A fast algorithm for the evaluation of Legendre expansions

SIAM Journal on Scientific and Statistical Computing
Efficient spectral-Galerkin method I: direct solvers of second-and fourth-order equations using Legendre polynomials

SIAM Journal on Scientific Computing
Efficient spectral-Galerkin method II.: direct solvers of second- and fourth-order equations using Chebyshev polynomials

SIAM Journal on Scientific Computing
An efficient spectral method for ordinary differential equations with rational function coefficients

Mathematics of Computation
Timely Communication: Efficient Algorithms for Solving a Fourth-Order Equation with the Spectral-Galerkin Method

SIAM Journal on Scientific Computing
The ultraspherical coefficients of the moments of a general-order derivative of an infinitely differentiable function

Journal of Computational and Applied Mathematics
A Legendre Spectral Galerkin Method for the Biharmonic Dirichlet Problem

SIAM Journal on Scientific Computing
Direct and Inverse Approximation Theorems for the p-Version of the Finite Element Method in the Framework of Weighted Besov Spaces. Part I: Approximability of Functions in the Weighted Besov Spaces

SIAM Journal on Numerical Analysis

Efficient spectral ultraspherical-dual-Petrov-Galerkin algorithms for the direct solution of (2n+1)th-order linear differential equations

Mathematics and Computers in Simulation
A Legendre Petrov-Galerkin method for fourth-order differential equations

Computers & Mathematics with Applications
Matrix decomposition algorithms for elliptic boundary value problems: a survey

Numerical Algorithms
A Chebyshev spectral method based on operational matrix for initial and boundary value problems of fractional order

Computers & Mathematics with Applications
A Jacobi-Jacobi dual-Petrov-Galerkin method for third- and fifth-order differential equations

Mathematical and Computer Modelling: An International Journal
An efficient direct solver for multidimensional elliptic Robin boundary value problems using a Legendre spectral-Galerkin method

Computers & Mathematics with Applications
New algorithms for solving high even-order differential equations using third and fourth Chebyshev-Galerkin methods

Journal of Computational Physics
A new Jacobi rational-Gauss collocation method for numerical solution of generalized pantograph equations

Applied Numerical Mathematics
Jacobi-Gauss-Lobatto collocation method for the numerical solution of 1+1 nonlinear Schrödinger equations

Journal of Computational Physics

Quantified Score

Hi-index	0.01

Visualization

Abstract

It is well known that for the discretization of the biharmonic operator with spectral methods (Galerkin, tau, or collocation) we have a condition number of O(N^8), where N is the number of retained modes of approximations. This paper presents some efficient spectral algorithms, for reducing this condition number to O(N^4), based on the Jacobi-Galerkin methods for fourth-order equations in one variable. The key to the efficiency of these algorithms is to construct appropriate base functions, which lead to systems with specially structured matrices that can be efficiently inverted. Jacobi-Galerkin methods for fourth-order equations in two dimension are considered. Numerical results indicate that the direct solvers presented in this paper are significantly more accurate at large N values than that based on the Chebyshev- and Legendre-Galerkin methods.