Numerical experiments on fine-grid linear systems arising from finite-volume discretizations of Darcy flow problems show that the proposed AlgMortar approach exhibits good scalability and is competitive with state-of-the-art algebraic multigrid methods for challenging heterogeneous, high-contrast test cases, including highly irregular corner-point grids.
Abstract
The solution of large-scale symmetric positive definite linear systems arising from discretizations of second-order elliptic equations is challenging, especially in applications with highly heterogeneous coefficients, such as flow in porous media, which can lead to severely ill-conditioned systems. In this context, multiscale methods have recently been used to accelerate Krylov subspace methods, owing to their favorable parallel scalability. In this work, we present AlgMortar, a fully algebraic realization of the Multiscale Mortar Mixed Finite Element Method (MMMFEM). The method uses only information extracted from the fine-grid system matrix, which facilitates its implementation in existing solvers. AlgMortar uses graph partitioning to define a domain decomposition directly from the matrix graph. On each subdomain, it builds local linear systems that mimic Dirichlet problems, and couples the resulting local solutions through an algebraic interface condition that recovers the weak flux-continuity mechanism of MMMFEM. We prove that the method is well posed when the fine-grid matrix is symmetric positive definite and has nonpositive off-diagonal entries, a structure commonly arising from discretizations of elliptic problems. Numerical experiments on fine-grid linear systems arising from finite-volume discretizations of Darcy flow problems show that, when used as a preconditioner for the conjugate gradient method, the proposed approach exhibits good scalability and is competitive with state-of-the-art algebraic multigrid methods for challenging heterogeneous, high-contrast test cases, including highly irregular corner-point grids.
We introduce a class of additive reduced basis preconditioners designed to accelerate the iterative solution of large-scale linear systems arising from discretized parametrized PDEs. The main idea is to regularize the inherently singular reduced-order approximation by adding simple correction terms: either a scaled ide...
An adaptive multigrid method for discontinuous Galerkin formulations of elliptic problems using Brandt's full approximation scheme (FAS), designed for unstructured curvilinear meshes but maintains a tensor-product structure for fast diagonalization.
Collocation methods based on Birkhoff interpolation at Gaussian-type points are well-conditioned for one-dimensional initial and boundary value problems [Wang et al., {\em SIAM J. Sci. Comput.} 36 (2014)], but the underlying construction does not extend directly to multiple dimensions. We address the long-standing ill-...
Shun-Chang Li, Zi-Xuan Gao, Yu-Jian Jiao et al.· 0 citations
This paper proposes an inexact interior-point relaxation method (iIPRM) for LO problems that does not require its iterates to remain strictly positive and employs a sparse preconditioner tailored to the structure of the normal matrix.
Rui-Jin Zhang, Yu-Hong Dai, Xin-Wei Liu et al.· Journal of Optimization Theo...· 0 citations
Nearly incompressible elasticity is often discretized by mixed methods to avoid locking, but the resulting saddle-point systems can be expensive to solve. We consider a weakly symmetric multipoint stress discretization whose stress and rotation unknowns can be eliminated independently over vertex interaction regions, l...
Time-fractional diffusion equations describe subdiffusive transport in heterogeneous media, but their numerical treatment is complicated by the nonlocal Caputo derivative and by the weak singularity that the solution develops at the initial time. We study a global-in-time discretization that combines spectral collocati...
P. De Luca· Fractal and Fractional· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.