Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
From MaRDI portal
Publication:6602282
DOI10.1007/s40314-024-02867-4MaRDI QIDQ6602282
Masoud Hajarian, Hojjatollah Shokri Kaveh, Anthony Theodore Chronopoulos
Publication date: 11 September 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Iterative numerical methods for linear systems (65F10) Numerical solutions to equations with linear operators (65J10) Numerical solutions to inverse eigenvalue problems (65F18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- A generalization of \(s\)-step variants of gradient methods
- BiCGStab(\(\ell\)) for families of shifted linear systems
- Two recursive GMRES-type methods for shifted linear systems with general preconditioning
- Parallel iterative S-step methods for unsymmetric linear systems
- A finite iterative method for solving the general coupled discrete-time periodic matrix equations
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- On a weighted quasi-residual minimization strategy for solving complex symmetric shifted linear systems
- s-step iterative methods for symmetric linear systems
- The stable \(A^TA\)-orthogonal \(s\)-step orthomin\((k)\) algorithm with the CADNA library
- Krylov space methods on state-space control models
- Efficient iterative methods applied to the solution of transonic flows
- On the convergence of conjugate direction algorithm for solving coupled Sylvester matrix equations
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- Determination of regularization parameter via solving a multi-objective optimization problem
- Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems
- Developing CGNE algorithm for the periodic discrete-time generalized coupled Sylvester matrix equations
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Block s-step Krylov iterative methods
- Minimizing Communication in Numerical Linear Algebra
- Nested Krylov Methods for Shifted Linear Systems
- Implementation of the GMRES Method Using Householder Transformations
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Variants of BICGSTAB for Matrices with Complex Spectrum
- A Newton basis GMRES implementation
- Restarted GMRES for Shifted Linear Systems
- The Adaptive $s$-Step Conjugate Gradient Method
- Iterative Krylov Methods for Large Linear Systems
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Krylov Methods for Nonsymmetric Linear Systems
- Mixed precision s‐step Lanczos and conjugate gradient algorithms
- s-Step Enlarged Krylov Subspace Conjugate Gradient Methods
- Communication Avoiding ILU0 Preconditioner
This page was built for publication: Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms