Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16359

An algebraic multiscale framework for two-level overlapping Schwarz preconditioners

Filipe Cumaru·Hadi Hajibeygi·Cornelis Vuik·Alexander Heinlein
View original source ↗Read source document ↗Export metadata ↓

Abstract

The robustness of two-level overlapping additive Schwarz (OAS) preconditioners for highly heterogeneous elliptic problems hinges on the choice of the coarse space. We propose an algebraic multiscale (AM) coarse space built from the system matrix alone through an algebraic formulation of the multiscale finite element method (MsFEM). The coarse basis functions are energy-minimizing extensions of the solutions of reduced boundary condition (RBC) problems on the subdomain interface, so that coefficient variations along the interface enter the coarse space. By posing the RBC problems on slabs that extend the interface, the construction also applies to general unstructured domain decompositions. Embedding the AM formulation in an energy-minimizing framework extends it to linear elasticity, and we show that existing condition number bounds for OAS with MsFEM coarse spaces carry over to the algebraic setting. For problems with high coefficient inclusions on the coarse nodes, the AM iteration count and condition number are unaffected by increasing the contrast. In 3D scalar diffusion with log-normal coefficients, AM needs about as many iterations as the generalized Dryja--Smith--Widlund (GDSW) coarse space, while solving a coarse problem ten times smaller. For linear elasticity, omitting the coarse basis functions associated with the rotational rigid body modes yields a fully algebraic coarse space that still scales well for homogeneous problems.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Filipe Cumaru, Hadi Hajibeygi, Cornelis Vuik, Alexander Heinlein. 2026-10-12. An algebraic multiscale framework for two-level overlapping Schwarz preconditioners. https://arxiv.org/abs/2610.16359

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

KEEP EXPLORING

Related papers

arXiv2026

An unconditionally convergent discontinuous Galerkin neural network method activated by plane waves for Helmholtz equation and Maxwell's equations

In this paper we propose a discontinuous Galerkin plane wave neural network (DGPWNN) method for approximately solving Helmholtz equation and Maxwell's equations. In this method, we define an elliptic-type variational problem as in the plane wave least square method with $h-$refinement and introduce the adaptive construction of recursively augmented discontinuous Galerkin subspaces whose basis functions are realizations of element-wise neural network functions with hp-refinement, where the activation function is chosen as a complex-valued exponential function like the plane wave function. A sequence of basis functions approaching the unit residuals are recursively generated by iteratively solving quasi-maximization problems associated with the underlying residual functionals and the intersection of the closed unit ball and discontinuous plane wave neural network spaces. The convergence results of the DGPWNN method are unconditional only if nonlinear initial parameters for the quasi-maximizers are selected by suitably distributed propagation directions, and established without the assumption on the boundedness of the neural network parameters. Numerical experiments confirm the effectiveness of the proposed method.

math.NA↗
arXiv2026

On the optimization of discrepancy measures

Numerical optimizations can find point sets with lower discrepancies than prior methods based on algebra, and $L_2$ discrepancies are computationally attractive for this. The $L_2$ star discrepancy unreasonably emphasizes the origin and Matoušek pointed to a serious drawback. He showed that the $L_2$ star discrepancy of $n$ points at $(1,\dots,1)\in[0,1]^d$ is less than the root mean squared $L_2$ star discrepancy of $n$ random points until $n>(3/2)^d-1$. We introduce the \emph{average squared discrepancy} (ASD) which averages $2^d$ versions of the squared $L_2$ star discrepancy, one for each vertex of $[0,1]^d$. We show that it can be computed in $O(dn^2)$ work and that it does not suffer from Matoušek's repeated-point pathology. We inspect several $L_2$ discrepancies that do not favor the origin over other vertices. Only two of them avoid the repeated-point pathology: a symmetric discrepancy and a periodic discrepancy. The symmetric discrepancy has a twin-point pathology where point sets with only $2$ distinct points can be better than random points until $n\ge 3^d$. We also study weighted $L_2$ discrepancies introduced by Hickernell that use some product weights. Weighting lower dimensional projections reduces but does not eliminate the repeated-point pathologies. A range of numerical experiments showcase recent progress in the construction of sets with low $L_2$ discrepancies for many different measures. In our examples, optimizing the ASD also gives good results for \emph{the other} discrepancies we consider, especially in lower dimensions. This version corrects some of the threshold sample sizes n at which random points become better than n repeated points for some discrepancy measures. In particular, the periodic L_2 discrepancy has no repeated point pathology.

math.NA↗
arXiv2026

Accelerated decomposition of bistochastic kernel matrices by low rank approximation

We develop an accelerated algorithm for the approximate eigenvalue decomposition of symmetrically normalized kernel matrices, focusing on a bistochastic normalization. Our approach constructs a low rank approximation of the original kernel matrix by the pivoted partial Cholesky algorithm, and uses it to compute an approximate decomposition of its normalization without requiring the formation of the full kernel matrix. The cost of the proposed algorithm depends linearly on the size of the employed training dataset and quadratically on the rank of the low rank approximation, offering a significant cost reduction compared to the naive approach. We derive trace norm error bounds for the approximation of two classes of normalized kernel matrices. We apply the proposed algorithm to the kernel based extraction of spatiotemporal patterns from chaotic Kuramoto-Sivashinsky dynamics, using a distributed GPU implementation that can scale to large datasets.

math.NA↗