Approximate Schur complement preconditioning of the lowest-order nodal discretizations
- Univ. of British Columbia, Vancouver, British Columbia (Canada)
- Los Alamos National Lab., NM (United States)
Certain classes of nodal methods and mixed-hybrid finite element methods lead to equivalent, robust, and accurate discretizations of second-order elliptic PDEs. However, widespread popularity of these discretizations has been hindered by the awkward linear systems which result. The present work overcomes this awkwardness and develops preconditioners which yield solution algorithms for these discretizations with an efficiency comparable t that of the multigrid method for standard discretizations. This approach exploits the natural partitioning of the linear system obtained by the mixed-hybrid finite element method. By eliminating different subsets of unknowns, two Schur complements are obtained with known structure. Replacing key matrices in this structure by lumped approximations, the authors define three optimal preconditioners. Central to the optimal performance of these preconditioners is their sparsity structure which is compatible with standard finite difference discretizations and hence treated adequately with only a single multigrid cycle. In this paper the authors restrict the discussion to the two-dimensional case; these techniques are readily extended to three dimensions.
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 599814
- Journal Information:
- SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 1 Vol. 19; ISSN 1064-8275; ISSN SJOCE3
- Country of Publication:
- United States
- Language:
- English
Similar Records
A preconditioning technique for Schur complement systems arising in stochastic optimization
Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems