AI & ML
An efficient coupled block preconditioner for the Marker-and-Cell discretization of the Stokes-Darcy equations
arXiv cs.NA0 views
arXiv:2610.34692v1 Announce Type: new Abstract: We consider the iterative solution of the large, sparse and nonsymmetric double saddle-point systems arising from the stationary Stokes-Darcy equations in two dimensions, discretized by the Marker-and- Cell (MAC) finite difference method. Existing block triangular preconditioners rest on approximations of two Schur complements, the second of which is hard to approximate uniformly in the physical parameters. We propose instead a coupled preconditioner that keeps the interface coupling and regularizes the constraint block by a small multiple of the identity, so that the second Schur complement never has to be approximated. We analyze the spectrum of the preconditioned matrix, both in the ideal case and for the inexact version used in computations, and derive from it a rule for scaling the regularization parameter with the physical parameters. Numerical results show mesh-independent convergence of preconditioned GMRES and robustness with respect to the viscosity and the permeability.
Source:https://arxiv.org/abs/2610.34692PreviousA Discontinuous Galerkin Method for Biharmonic Dirichlet Control Problems With Patch ReconstructionNextA High-Order Geometric-Compatible DGSEM with Subcell Limiting for the GPR System
Related posts
Introducing the Grid Protectors Program
0OpenAI Blog
The world has a new plan to save nature, but it still needs the money
0Ars Technica

Could data center backlash flip Florida?
0The Verge

Vivo’s first Pro Max phone proves its Ultra is still in a league of its own
0The Verge

Why Peacock is making a huge bet on YouTube
0The Verge
Ninja’s first-ever microwave just replaced two of my kitchen appliances at once
0TechCrunch