Efficient algorithms for approximating particular solutions of elliptic equations using Chebyshev polynomials
Ημερομηνία
2007ISSN
1815-2406Source
Communications in Computational PhysicsVolume
2Issue
3Pages
501-521Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
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. © 2007 Global-Science Press.