Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations
From MaRDI portal
Publication:3383755
DOI10.1142/S0219876221500274OpenAlexW3130672287MaRDI QIDQ3383755
Hiroshi Okuda, Noriyuki Kushida
Publication date: 16 December 2021
Published in: International Journal of Computational Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219876221500274
Related Items
A New Type of Variable Preconditioning for a Generalized Minimum Residual Scheme, A performance evaluation of a new flexible preconditioning method on a parallel finite element structure analysis program, FrontISTR, Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations
Cites Work
- A comparative study of sparse approximate inverse preconditioners
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- Analysis and practical use of flexible biCGStab
- Flexible Conjugate Gradients
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations
- Updating Quasi-Newton Matrices with Limited Storage
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Flexible Inner-Outer Krylov Subspace Methods
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- The Lanczos and Conjugate Gradient Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item