Search arXivSearch

arXiv · 2607.21295

An unfitted boundary algebraic equation method with Calderón preconditioning for 2D Stokes flow in irregular geometry

Abstract

We present an unfitted boundary algebraic equation method for the two-dimensional exterior/interior Stokes equations on a staggered MAC grid. By constructing an explicit free-space pair of velocity and pressure lattice Green's functions (LGFs) from free-space Laplace LGFs, we represent homogeneous fields using sources supported exclusively on thin staggered boundary layers. This formulation imposes physical Dirichlet data at cut points via local interpolation, while sampled-normal rank updates remove hydrostatic null modes associated with single or multiple obstacles. The workflow parallels that of classical boundary integral formulations and requires no artificial boundary conditions for exterior flows, but follows a discretize-then-represent route and does not require singular/near-singular quadrature. The resulting dense boundary system is solved via GMRES, utilizing a componentwise discrete Calderón preconditioner built from the scalar Laplace kernel and padded FFTs for fast volume convolutions. Extensive numerical validation, including multiply connected domains, narrow gaps, and Moffatt eddies, confirms discrete incompressibility to solver accuracy and recovers the expected Moffatt eddy scaling. We achieve second-order velocity and pressure convergence and bound maximum discrete divergence within numerical accuracy. The discrete Calderón preconditioner reduces the condition number by orders of magnitude and yields nearly mesh-independent conditioning in exterior configurations, while remaining effective---though more demanding---for narrow-gap and fine-grid interior problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenjun Ying, Qing Xia. 2026-07-23. An unfitted boundary algebraic equation method with Calderón preconditioning for 2D Stokes flow in irregular geometry. https://arxiv.org/abs/2607.21295

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA