.png){kind=icon}
Return
Algebraic multigrid solvers for complex-valued matrices
.png){kind=icon}
OA
AI
DOI：10.1137/070687232.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e. g., Krylov-subspace methods, extend directly to the case of complex-valued matrices, some of the most effective preconditioning techniques and linear solvers are limited to the real-valued case. Here, we consider the extension of the popular algebraic multigrid method to such complex-valued systems. The choices for this generalization are motivated by classical multigrid considerations, evaluated with the tools of local Fourier analysis, and verified on a selection of problems related to real-life applications.
Keywords:
multigrid
algebraic multigrid
complex-valued matrices
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
Tuning the electronic and optical properties of BaNiO3 via Fe substitution: a first-principles study
PREAI
ShareSave
ShareSaveShareSave
View more