A New Type of Variable Preconditioning for a Generalized Minimum Residual Scheme
From MaRDI portal
Publication:6173064
DOI10.1142/s0219876222500414OpenAlexW4293205955WikidataQ114072353 ScholiaQ114072353MaRDI QIDQ6173064
Noriyuki Kushida, Hiroshi Okuda
Publication date: 21 July 2023
Published in: International Journal of Computational Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219876222500414
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Accelerating with rank-one updates
- Flexible BiCG and flexible Bi-CGSTAB for nonsymmetric linear systems
- Flexible Conjugate Gradients
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- GPBi‐CGstab( L ): A Lanczos‐type product method unifying Bi‐CGstab( L ) and GPBi‐CG
- Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Updating Quasi-Newton Matrices with Limited Storage
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Variants of BICGSTAB for Matrices with Complex Spectrum
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- GMRESR: a family of nested GMRES methods
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Methods of conjugate gradients for solving linear systems
- FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning
