A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
From MaRDI portal
Publication:4721520
DOI10.1093/imanum/6.4.447zbMath0614.65028OpenAlexW2124766533MaRDI QIDQ4721520
Publication date: 1986
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/6.4.447
Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items (12)
A structure preserving difference scheme with fast algorithms for high dimensional nonlinear space-fractional Schrödinger equations ⋮ Lanczos-type variants of the COCR method for complex nonsymmetric linear systems ⋮ The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation ⋮ Choice of the perfectly matched layer boundary condition for frequency-domain Maxwell's equations solvers ⋮ A Variable Metric Method for Approximating Generalized Inverses of Matrices ⋮ A Variable Metric Method for Approximating Generalized Inverses of Matrices ⋮ Complex conjugate gradient methods ⋮ Real valued iterative methods for solving complex symmetric linear systems ⋮ Some results on sparse block factorization iterative methods ⋮ Fast structure-preserving difference algorithm for 2D nonlinear space-fractional wave models
This page was built for publication: A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
