Approximate Schur Complement Preconditioning of the Lowest-Order Nodal Discretizations
From MaRDI portal
conjugate gradientmultigridnatural partitioningnodal discretizationpreconditionerreduced systemSchur complement
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
Recommendations
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Preconditioning of Boundary Value Problems Using Elementwise Schur Complements
- Additive Schur complement approximation and application to multilevel preconditioning
- A new approximation of the Schur complement in preconditioners for PDE-constrained optimization.
- Schur complement preconditioning for elliptic systems of partial differential equations
- On the Schur component preconditioners
- Schur complement preconditioners for the Navier–Stokes equations
- Schur complement preconditioners for anisotropic problems
- Approximate Schur Complement Preconditioners on Serial and Parallel Computers
Cited in
(2)
This page was built for publication: Approximate Schur Complement Preconditioning of the Lowest-Order Nodal Discretizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389237)