The P-aAA method solves generalized Sylvester equations more efficiently than prior approaches by combining alternating Anderson acceleration with a first-order Neumann series preconditioner that accelerates convergence without added complexity.
Saad , Iterative methods for sparse linear systems , SIAM, 2003
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.NA 3representative citing papers
Localized subspace iteration (LSI) methods, including LSSI and LKSI variants, are introduced to construct multiscale finite element bases via local operator localization and subspace iteration on spectral problems, supported by convergence analysis and numerical tests showing advantages in long-ch
citing papers explorer
-
Efficient Solution of Generalized Sylvester Equations via Preconditioned Alternating Anderson Acceleration
The P-aAA method solves generalized Sylvester equations more efficiently than prior approaches by combining alternating Anderson acceleration with a first-order Neumann series preconditioner that accelerates convergence without added complexity.
-
Localized subspace iteration methods for elliptic multiscale problems
Localized subspace iteration (LSI) methods, including LSSI and LKSI variants, are introduced to construct multiscale finite element bases via local operator localization and subspace iteration on spectral problems, supported by convergence analysis and numerical tests showing advantages in long-ch
- Towards Universal Convergence of Backward Error in Linear System Solvers