Efficient algorithms for approximating particular solutions of elliptic equations using Chebyshev polynomials

Andreas Karageorghis*, Irene Kyza

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we propose efficient algorithms for approximating particular solutions of second and fourth order elliptic equations. The approximation of the particular solution by a truncated series of Chebyshev polynomials and the satisfaction of the differential equation lead to upper triangular block systems, each block being an upper triangular system. These systems can be solved efficiently by standard techniques. Several numerical examples are presented for each case.

Original languageEnglish
Pages (from-to)501-521
Number of pages21
JournalCommunications in Computational Physics
Volume2
Issue number3
Publication statusPublished - Jun 2007

Keywords

  • Biharmonic equation
  • Chebyshev polynomials
  • Method of particular solutions
  • Poisson equation

Fingerprint

Dive into the research topics of 'Efficient algorithms for approximating particular solutions of elliptic equations using Chebyshev polynomials'. Together they form a unique fingerprint.

Cite this