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)
Particular classes of nodal methods and mixed hybrid finite element methods lead to equivalent, robust and accurate discretizations of 2nd order elliptic PDEs. However, widespread popularity of these discretizations has been hindered by the awkward linear systems which result. The present work exploits this awkwardness, which provides a natural partitioning of the linear system, by defining two optimal preconditioners based on approximate Schur complements. Central to the optimal performance of these preconditioners is their sparsity structure which is compatible with Dendy`s black box multigrid code.
- Research Organization:
- Front Range Scientific Computations, Inc., Lakewood, CO (United States)
- OSTI ID:
- 433355
- Report Number(s):
- CONF-9604167--Vol.1; ON: DE96015306
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximate Schur complement preconditioning of the lowest-order nodal discretizations
A preconditioning technique for Schur complement systems arising in stochastic optimization
Multigrid solution of a distributed optimal control problem constrained by the Stokes equations
Journal Article
·
Wed Dec 31 23:00:00 EST 1997
· SIAM Journal on Scientific Computing
·
OSTI ID:599814
A preconditioning technique for Schur complement systems arising in stochastic optimization
Journal Article
·
Sat Dec 31 23:00:00 EST 2011
· Computational Optimization and Applications
·
OSTI ID:1051208
Multigrid solution of a distributed optimal control problem constrained by the Stokes equations
Journal Article
·
Wed Jan 02 23:00:00 EST 2013
· Applied Mathematics and Computation
·
OSTI ID:1493158