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 QIDQ6602282FDOQ6602282
Authors: Hojjatollah Shokri Kaveh, Masoud Hajarian, Anthony T. Chronopoulos 
Publication date: 11 September 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
- Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations
- Developing variable \(s\)-step CGNE and CGNR algorithms for non-symmetric linear systems
- Projection regularization algorithm for solving linear algebraic system of large dimension
- Exploiting BiCGSTAB(\(\ell\)) strategies to induce dimension reduction
- An overview of approaches for the stable computation of hybrid BiCG methods
Iterative numerical methods for linear systems (65F10) Numerical solutions to inverse eigenvalue problems (65F18) Numerical solutions to equations with linear operators (65J10)
Cites Work
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Title not available (Why is that?)
- Communication-optimal parallel and sequential QR and LU factorizations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing communication in numerical linear algebra
- Variants of BICGSTAB for Matrices with Complex Spectrum
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Iterative Krylov Methods for Large Linear Systems
- A finite iterative method for solving the general coupled discrete-time periodic matrix equations
- s-step iterative methods for symmetric linear systems
- Block-\(s\)-step Krylov iterative methods
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- A generalization of \(s\)-step variants of gradient methods
- Parallel iterative S-step methods for unsymmetric linear systems
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- Nested Krylov Methods for Shifted Linear Systems
- A Newton basis GMRES implementation
- Restarted GMRES for Shifted Linear Systems
- BiCGStab(\(\ell\)) for families of shifted linear systems
- On a weighted quasi-residual minimization strategy for solving complex symmetric shifted linear systems
- The stable \(A^TA\)-orthogonal \(s\)-step orthomin\((k)\) algorithm with the CADNA library
- Implementation of the GMRES Method Using Householder Transformations
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Efficient iterative methods applied to the solution of transonic flows
- Two recursive GMRES-type methods for shifted linear systems with general preconditioning
- Developing CGNE algorithm for the periodic discrete-time generalized coupled Sylvester matrix equations
- Determination of regularization parameter via solving a multi-objective optimization problem
- Krylov space methods on state-space control models
- Krylov methods for nonsymmetric linear systems. From theory to computations
- The adaptive \(s\)-step conjugate gradient method
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- Title not available (Why is that?)
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- Title not available (Why is that?)
- Communication Avoiding ILU0 Preconditioner
- On the convergence of conjugate direction algorithm for solving coupled Sylvester matrix equations
- Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems
- Mixed precision s‐step Lanczos and conjugate gradient algorithms
- s-step enlarged Krylov subspace conjugate gradient methods
This page was built for publication: Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602282)
