Scalable augmented Lagrangian preconditioners for fictitious domain problems
By: Michele Benzi , Marco Feder , Luca Heltai and more
Potential Business Impact:
Speeds up computer math for science problems.
We present preconditioning techniques to solve linear systems of equations with a block two-by-two and three-by-three structure arising from finite element discretizations of the fictitious domain method with Lagrange multipliers. In particular, we propose two augmented Lagrangian-based preconditioners to accelerate the convergence of iterative solvers for such classes of linear systems. We consider two relevant examples to illustrate the performance of these preconditioners when used in conjunction with flexible GMRES: the Poisson and the Stokes fictitious domain problems. A spectral analysis is established for both exact and inexact versions of the preconditioners. We show the effectiveness of the proposed approach and the robustness of our preconditioning strategy through extensive numerical tests in both two and three dimensions.
Similar Papers
Triangular preconditioners for double saddle point linear systems arising in the mixed form of poroelasticity equations
Numerical Analysis
Solves hard math problems faster for science.
Multigrid Preconditioning for FD-DLM Method in Elliptic Interface Problems
Numerical Analysis
Solves hard math problems much faster for computers.
Polynomial and Parallelizable Preconditioning for Block Tridiagonal Positive Definite Matrices
Optimization and Control
Speeds up robots solving hard math problems.