A fully algebraic and robust two-level Schwarz method based on optimal local approximation spaces
A Heinlein, K Smetana - arXiv preprint arXiv:2207.05559, 2022 - arxiv.org
Two-level domain decomposition preconditioners lead to fast convergence and scalability of
iterative solvers. However, for highly heterogeneous problems, where the coefficient function …
iterative solvers. However, for highly heterogeneous problems, where the coefficient function …
Fully algebraic domain decomposition preconditioners with adaptive spectral bounds
L Gouarin, N Spillane - arXiv preprint arXiv:2106.10913, 2021 - arxiv.org
In this article a new family of preconditioners is introduced for symmetric positive definite
linear systems. The new preconditioners, called the AWG preconditioners (for Algebraic …
linear systems. The new preconditioners, called the AWG preconditioners (for Algebraic …
A Scalable Two-Level Domain Decomposition Eigensolver for Periodic Schr\" odinger Eigenstates in Anisotropically Expanding Domains
Accelerating iterative eigenvalue algorithms is often achieved by employing a spectral
shifting strategy. Unfortunately, improved shifting typically leads to a smaller eigenvalue for …
shifting strategy. Unfortunately, improved shifting typically leads to a smaller eigenvalue for …
A Robust Two-Level Schwarz Preconditioner For Sparse Matrices
This paper introduces a fully algebraic two-level additive Schwarz preconditioner for general
sparse large-scale matrices. The preconditioner is analyzed for symmetric positive definite …
sparse large-scale matrices. The preconditioner is analyzed for symmetric positive definite …
Coarse spaces for non-symmetric two-level preconditioners based on local generalized eigenproblems
Domain decomposition (DD) methods are a natural way to take advantage of parallel
computers when solving large scale linear systems. Their scalability depends on the design …
computers when solving large scale linear systems. Their scalability depends on the design …
[PDF][PDF] GM Bibliography
G Meurant - 2023 - gerard-meurant.fr
[16] P.-A. Absil, R. Mahony, and B. Andrews. Convergence of the iterates of descent
methods for analytic cost functions. SIAM J. Optim., 16 (2): 531–547, 2005.[17] A. Abu-Omar …
methods for analytic cost functions. SIAM J. Optim., 16 (2): 531–547, 2005.[17] A. Abu-Omar …
[PDF][PDF] Direct and Iterative Methods for Linear Systems
G Meurant - 2024 - gerard-meurant.fr
Solving linear systems of equations is ubiquitous in scientific computing. Therefore,
numerical algorithms for solving them are of paramount importance. There are two main …
numerical algorithms for solving them are of paramount importance. There are two main …