Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.03447

Two-level additive Schwarz preconditioners with GDSW coarse spaces for high-order discretizations in 3D

Tommaso Bevilacqua·Axel Klawonn·Martin Lanser·Adam Wasiak
View original source ↗Read source document ↗Export metadata ↓

Abstract

Overlapping Schwarz methods are among the most successful domain decomposition preconditioners for large-scale finite element simulations. In this work, the Generalized Dryja-Smith-Widlund (GDSW), GDSW$^*$, and Reduced GDSW (RGDSW) coarse spaces are studied for three-dimensional high-order finite element method (FEM) and virtual element method (VEM) for the Poisson equation and the equations of linear elasticity. To the best of our knowledge, this is the first study of GDSW-type coarse spaces for polynomial degrees $k\ge 3$ in three dimensions, for either discretization. In 3D VEM, the face degrees of freedom (DOFs) are moments instead of point values. The kernel of the differential operator, which defines the interface values of the GDSW coarse basis functions, must be represented through these moments. The construction is therefore no longer purely algebraic and, without this correction, the coarse level loses its effect for $k\ge 3$. FEM and VEM are tested on hexahedral meshes, and VEM is additionally tested on polyhedral ones. Polynomial degrees up to $k=5$ and runs on up to $4\,096$ subdomains and parallel cores are included in the numerical study. Numerical experiments show scalable iteration counts for all coarse space variants for the Poisson problem, illustrating the expected trade-off between the coarse space size and robustness. Further experiments for linear elasticity confirms that the moment-based construction extends naturally from the scalar to the vector-valued problem.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tommaso Bevilacqua, Axel Klawonn, Martin Lanser, Adam Wasiak. 2026-11-02. Two-level additive Schwarz preconditioners with GDSW coarse spaces for high-order discretizations in 3D. https://arxiv.org/abs/2611.03447

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

KEEP EXPLORING

Related papers

arXiv2026

Extracting Dual Analytic Geometries of Linear Transformations to Achieve Efficient Computation

We generalize the Calderon-Zygmund methodology for operator analysis and the Rokhlin-Greengard fast multipole algorithms, in which the domain and range of an operator are jointly organized. Our methods analyze unstructured kernels by uncovering the joint hidden geometries of their domain and range. The main tool is the Questionnaire algorithm, an iterative procedure that constructs adaptive bi-hierarchical partition trees that reveal latent multiscale organization and local low-rank structure in the kernel. When the geometry is unknown, the iteration starts from any initial affinity, even a random one, and, with a stochastic flip perturbation and a spectral space-filling curve that fixes the left-right order of every tree, reorganizes the matrix into an image of the operator's "phase space": the joint space of its sources and sensors, in duality, as positions and frequencies are for the Fourier transform. This ordering gives the phase space an analytic structure on which any classical transform can be carried out; the resulting compression is direct evidence of that structure. Guided by these geometries, we obtain efficient factorizations and fast matrix-vector products in two ways: (1) the Butterfly algorithm, which exploits the learned bi-hierarchical localized low-rank structure; and (2) the adaptive eGHWT, which selects best tilings in space and sequency from all levels of generalized Haar-Walsh wavelet packets. We call the resulting algorithms the Questionnaire Factorization and Fast Transform (QFFT). Unlike classical approaches requiring prior knowledge of the geometry, QFFT is fully data-driven and applies to matrices from irregular or unknown distributions. We demonstrate it on heterogeneous oscillatory operators and on orthogonal eigenvector expansions with high multiplicity and random sampling, reducing storage from O(N^2) to O(N log N) and enabling fast, scalable computation.

math.NA↗
arXiv2026

Decoupled energy-stable Runge-Kutta schemes of arbitrary order for the anisotropic phase-field dendritic crystal growth model

This paper introduces a novel and general framework for constructing arbitrary-order, energy-stable, and decoupled schemes for the anisotropic phase-field dendritic crystal growth model. The proposed framework combines a time-dependent auxiliary variable, an algebraically stable Runge-Kutta method, and a matrix diagonalization technique. This unique combination yields a scheme that is proven to be unconditionally energy-dissipative while requiring only the solution of independent, constant-coefficient elliptic equations at each time step, which can be solved in parallel. The auxiliary variable is recovered from a uniquely solvable $q\times q$ algebraic system. We provide a rigorous proof of $q$th-order convergence in time for a $q$-stage Runge-Kutta method within a fixed Fourier-Galerkin space. Numerical experiments in 2D and 3D not only confirm the theoretical convergence and energy stability but also demonstrate the efficiency of the decoupled approach and provide a detailed investigation of key parameters' effects on dendritic morphology.

math.NA↗
arXiv2026

Automated Numerical Stability Analysis of Deep Learning Operators

Finite-precision arithmetic unavoidably introduces numerical approximation errors. Numerical computations may use insufficient precision or an improper formulation, which leads to numerical instability. In this paper, we introduce a unified software tool for stochastic numerical validation of deep-learning operators. The tool follows CESTAC on supported exposed operations and uses an operator-level data-perturbation approximation for GEMM-like kernels. Our developed software not only enables numerical validation with a single computation pass but also detects the sources of numerical instability and provides numerical stability monitoring during deep learning training and inference. We verified its effectiveness on the detection of polluted operators with injected numerical instabilities across various tasks. We believe that our developed method and tools provide valuable insights into developing numerically stable computing kernels, which are particularly critical for numerically stable and efficient deep learning training and inference.

math.NA↗