A block IDR(s) method for nonsymmetric linear systems with multiple right-hand sides
From MaRDI portal
Publication:548308
DOI10.1016/J.CAM.2011.02.035zbMATH Open1219.65037OpenAlexW1994115828MaRDI QIDQ548308FDOQ548308
Authors: Tomohiro Sogabe, Bo Yu, Yusaku Yamamoto, Lei Du, Shao-Liang Zhang 
Publication date: 28 June 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.02.035
Recommendations
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- An enhancement of the convergence of the IDR method
- Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
algorithmsnumerical experimentsinduced dimension reductionmultiple right-hand sidesblock methodBi-CG based methodsBiCGStablarge nonsymmetric linear systems
Cites Work
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
- Exploiting BiCGSTAB(\(\ell\)) strategies to induce dimension reduction
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- Bi-CGSTAB as an induced dimension reduction method
- GBi-CGSTAB(\(s,L\)): IDR(\(s\)) with higher-order stabilization polynomials
- Title not available (Why is that?)
- ML(k)BiCGSTAB: A BiCGSTAB Variant Based on Multiple Lanczos Starting Vectors
- The block conjugate gradient algorithm and related methods
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- Global FOM and GMRES algorithms for matrix equations
- Convergence properties of block GMRES and matrix polynomials
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Oblique projection methods for linear systems with multiple right-hand sides
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Simpler block GMRES for nonsymmetric systems with multiple right-hand sides
- Skew-symmetric methods for nonsymmetric linear systems with multiple right-hand sides
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- The block Lanczos method for linear systems with multiple right-hand sides
- Numerical Linear Algebra for High-Performance Computers
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- A Stabilized QMR Version of Block BiCG
- The block grade of a block Krylov space
- Transpose-free multiple Lanczos and its application in Padé approximation
- QMR-based projection techniques for the solution of non-Hermitian systems with multiple right-hand sides
- Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
Cited In (22)
- IDR(\(s\)) for solving shifted nonsymmetric linear systems
- Title not available (Why is that?)
- An accurate and efficient acoustic eigensolver based on a fast multipole BEM and a contour integral method
- An enhancement of the convergence of the IDR method
- A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
- A variant of the IDR\((s)\) method with the quasi-minimal residual strategy
- Kω -- open-source library for the shifted Krylov subspace method of the form \((z I - H)x = b\)
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
- Title not available (Why is that?)
- Block variants of the COCG and COCR methods for solving complex symmetric linear systems with multiple right-hand sides
- A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
- ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
- Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- A block preconditioned harmonic projection method for large-scale nonlinear eigenvalue problems
- A modified block \(IDR(s)\) method for computing high accuracy solutions
- A block EN algorithm for nonsymmetric linear systems with multiple right-hand sides
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- The Block Rational Arnoldi Method
- MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides
Uses Software
This page was built for publication: A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548308)
