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

https://doi.org/10.1016/j.apnum.2007.07.001Get rights and content

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(N8), where N is the number of retained modes of approximations. This paper presents some efficient spectral algorithms, for reducing this condition number to O(N4), 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.

References (50)

  • T.A. Zang et al.

    Spectral multigrid methods for elliptic equations II

    J. Comput. Phys.

    (1984)
  • W.M. Abd-Elhameed, Spectral Galerkin method for solving second and fourth order differential equations by using...
  • B.K. Alperto et al.

    A fast algorithm for the evaluation of Legendre expansions

    SIAM J. Sci. Statist. Comput.

    (1991)
  • I. Babuška et al.

    Optimal estimates for lower and upper bounds of approximation errors in the p-version of the finite element method in two-dimensions

    Numer. Math.

    (2000)
  • I. Babuška et al.

    Direct and inverse approximation theorems for the p-version of the finite element method in the framework of weighted Besov spaces, I. Approximability of functions in the weighted Besov spaces

    SIAM J. Numer. Anal.

    (2002)
  • C. Bernardi, Y. Maday, Some spectral approximations of one-dimensional fourth-order problems, ICASE Report No. 89–36,...
  • C. Bernardi et al.

    Some spectral approximations of fourth-order problems

  • B. Bialecki et al.

    A Legendre spectral collocation method for the biharmonic Dirichlet problem

    Math. Model. Numer. Anal.

    (2000)
  • B. Bialecki et al.

    A Legendre spectral Galerkin method for the biharmonic Dirichlet problem

    SIAM J. Sci. Comput.

    (2000)
  • P. Bjørstad

    Fast numerical solution of the biharmonic Dirichlet problem on rectangles

    SIAM J. Numer. Anal.

    (1983)
  • P.E. Bjørstad et al.

    Efficient algorithms for solving a fourth-order equation with the spectral-Galerkin method

    SIAM J. Sci. Comput.

    (1997)
  • J.P. Boyd

    Chebyshev and Fourier Spectral Methods

    (2001)
  • B.L. Buzbee et al.

    The direct solution of the biharmonic equation on rectangular regions and the Poisson equation on irregular domains

    SIAM J. Numer. Anal.

    (1971)
  • C. Canuto et al.

    Spectral Methods in Fluid Dynamics

    (1989)
  • P.G. Ciarlet et al.

    A mixed finite element method for the biharmonic equation

  • Cited by (95)

    • Legendre–Galerkin spectral-element method for the biharmonic equations and its applications

      2017, Computers and Mathematics with Applications
      Citation Excerpt :

      The Stokes and Navier–Stokes equations involving the stream-function formulation were solved by spectral collocation-type methods in [3]. Based on the Jacobi–Galerkin methods, [7] has presented some efficient direct solvers for general fourth-order equations subject to various boundary conditions. In the mixed approach [8–16], the fourth-order equation is first replaced by a coupled system of two second-order differential equations, and this system is then discretized by the finite difference or finite element method.

    View all citing articles on Scopus
    View full text