Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
GPT-5.1
GPT-5.1 72 tok/s
Gemini 3.0 Pro 51 tok/s Pro
Gemini 2.5 Flash 147 tok/s Pro
Kimi K2 185 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

A-posteriori-steered $p$-robust multigrid and domain decomposition methods with optimal step-sizes for mixed finite element discretizations of elliptic problems (2406.09872v1)

Published 14 Jun 2024 in math.NA and cs.NA

Abstract: In this work, we develop algebraic solvers for linear systems arising from the discretization of second-order elliptic problems by saddle-point mixed finite element methods of arbitrary polynomial degree $p \ge 0$. We present a multigrid and a two-level domain decomposition approach in two or three space dimensions, which are steered by their respective a posteriori estimators of the algebraic error. First, we extend the results of [A. Mira\c{c}i, J. Pape\v{z}, and M. Vohral\'ik, SIAM J. Sci. Comput. 43 (2021), S117--S145] to the mixed finite element setting. Extending the multigrid procedure itself is rather natural. To obtain analogous theoretical results, however, a multilevel stable decomposition of the velocity space is needed. In two space dimensions, we can treat the velocity space as the curl of a stream-function space, for which the previous results apply. In three space dimensions, we design a novel stable decomposition by combining a one-level high-order local stable decomposition of [Chaumont-Frelet and Vohral\'ik, SIAM J. Numer. Anal. 61 (2023), 1783--1818] and a multilevel lowest-order stable decomposition of [Hiptmair, Wu, and Zheng, Numer. Math. Theory Methods Appl. 5 (2012), 297--332]. This allows us to prove that our multigrid solver contracts the algebraic error at each iteration and, simultaneously, that the associated a posteriori estimator is efficient. A $p$-robust contraction is shown in two space dimensions. Next, we use this multilevel methodology to define a two-level domain decomposition method where the subdomains consist of overlapping patches of coarse-level elements sharing a common coarse-level vertex. We again establish a ($p$-robust) contraction of the solver and efficiency of the a posteriori estimator. Numerical results presented both for the multigrid approach and the domain decomposition method confirm the theoretical findings.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.