Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
From MaRDI portal
Publication:6602282
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
Cites work
- scientific article; zbMATH DE number 434537 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2080875 (Why is no real title available?)
- A Newton basis GMRES implementation
- A finite iterative method for solving the general coupled discrete-time periodic matrix equations
- A generalization of \(s\)-step variants of gradient methods
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BiCGStab(\(\ell\)) for families of shifted linear systems
- Block-\(s\)-step Krylov iterative methods
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Communication Avoiding ILU0 Preconditioner
- Communication-optimal parallel and sequential QR and LU factorizations
- Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems
- Determination of regularization parameter via solving a multi-objective optimization problem
- Developing CGNE algorithm for the periodic discrete-time generalized coupled Sylvester matrix equations
- Efficient iterative methods applied to the solution of transonic flows
- Implementation of the GMRES Method Using Householder Transformations
- Iterative Krylov Methods for Large Linear Systems
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- Krylov methods for nonsymmetric linear systems. From theory to computations
- Krylov space methods on state-space control models
- Minimizing communication in numerical linear algebra
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- Mixed precision s‐step Lanczos and conjugate gradient algorithms
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- Nested Krylov Methods for Shifted Linear Systems
- On a weighted quasi-residual minimization strategy for solving complex symmetric shifted linear systems
- On the convergence of conjugate direction algorithm for solving coupled Sylvester matrix equations
- Parallel iterative S-step methods for unsymmetric linear systems
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Restarted GMRES for Shifted Linear Systems
- The adaptive \(s\)-step conjugate gradient method
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- The stable \(A^TA\)-orthogonal \(s\)-step orthomin\((k)\) algorithm with the CADNA library
- Two recursive GMRES-type methods for shifted linear systems with general preconditioning
- Variants of BICGSTAB for Matrices with Complex Spectrum
- s-step enlarged Krylov subspace conjugate gradient methods
- s-step iterative methods for symmetric linear systems
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)
