Cascadic Multilevel Algorithms for Symmetric Saddle Point Systems
Constantin Bacuta

TL;DR
This paper presents a multilevel cascadic algorithm for symmetric saddle point systems that efficiently combines stable finite element pairs and fast solvers, achieving near-optimal approximation rates.
Contribution
It introduces a new cascade-based multilevel algorithm with novel error estimates and a level change criterion for symmetric saddle point systems, applicable to various boundary value problems.
Findings
Achieves near-optimal approximation rates.
Efficiently combines finite element pairs and solvers.
Applicable to a broad class of boundary value problems.
Abstract
In this paper, we introduce a multilevel algorithm for approximating variational formulations of symmetric saddle point systems. The algorithm is based on availability of families of stable finite element pairs and on the availability of fast and accurate solvers for it symmetric positive definite systems. On each fixed level an efficient solver such as the gradient or the conjugate gradient algorithm for inverting a Schur complement is implemented. The level change criterion follows the cascade principle and requires that the iteration error be close to the expected discretization error. We prove new estimates that relate the iteration error and the residual for the constraint equation. The new estimates are the key ingredients in imposing an efficient level change criterion. The first iteration on each new level uses information about the best approximation of the discrete solution…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Model Reduction and Neural Networks · Matrix Theory and Algorithms
