Abstract
We develop and analyze a procedure for creating a hierarchical basis of continuous piecewise linear polynomials on an arbitrary, unstructured, nonuniform triangular mesh. Using these hierarchical basis functions, we are able to define and analyze corresponding iterative methods for solving the linear systems arising from finite element discretizations of elliptic partial differential equations. We show that such iterative methods perform as well as those developed for the usual case of structured, locally refined meshes. In particular, we show that the generalized condition numbers for such iterative methods are of order J2, where J is the number of hierarchical basis levels.
Original language | English (US) |
---|---|
Pages (from-to) | 1-36 |
Number of pages | 36 |
Journal | Numerische Mathematik |
Volume | 73 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1 1996 |
Externally published | Yes |
Bibliographical note
Generated from Scopus record by KAUST IRTS on 2023-02-15ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics