Efficient Preconditioning for the p-Version Finite Element Method in Two Dimensions
Abstract
The authors formulate and analyze parallel preconditioners for systems of equations arising from the p-version finite element method. Using new theoretical results for polynomial spaces, they prove that condition number grows as log squared p, where p is the degree of the polynomial space. Numerical results are presented showing that the condition number indeed grows very slowly with p. Keywords: p-Version finite element method, Preconditioning, Domain decomposition, Parallel computation, Polynomial Sobolev inequality, Polynomial extension theorems.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1989
- Accession Number
- ADA216210
Entities
People
- A. Craig
- Ivo Babuška
- J. Mandel
- J. Pitkaranta
Organizations
- University of Maryland