Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics

Bernard Bialecki, Graeme Fairweather, David B. Knudson, D. Abram Lipman, Que N. Nguyen, Weiwei Sun, Gadalia M. Weinberg

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

3 Citations (Scopus)

Abstract

Matrix decomposition algorithms (MDAs) employing fast Fourier transforms are developed for the solution of the systems of linear algebraic equations arising when the finite element Galerkin method with piecewise Hermite bicubics is used to solve Poisson's equation on the unit square. Like their orthogonal spline collocation counterparts, these MDAs, which require O(N2logN) operations on an N×N uniform partition, are based on knowledge of the solution of a generalized eigenvalue problem associated with the corresponding discretization of a two-point boundary value problem. The eigenvalues and eigenfunctions are determined for various choices of boundary conditions, and numerical results are presented to demonstrate the efficacy of the MDAs. © Springer Science + Business Media, LLC 2008.
Original languageEnglish
Pages (from-to)1-23
JournalNumerical Algorithms
Volume52
Issue number1
DOIs
Publication statusPublished - Aug 2009

Research Keywords

  • Eigenvalues and eigenfunctions
  • Elliptic boundary value problems
  • Finite element Galerkin method
  • Generalized eigenvalue problem
  • Matrix decomposition algorithm
  • Piecewise Hermite cubics

Fingerprint

Dive into the research topics of 'Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics'. Together they form a unique fingerprint.

Cite this