A block IDR(s) method for nonsymmetric linear systems with multiple right-hand sides

DOI10.1016/J.CAM.2011.02.035MaRDI QIDQ548308zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsnumerical experimentsinduced dimension reductionmultiple right-hand sidesblock methodBi-CG based methodsBiCGStablarge nonsymmetric linear systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

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

Cites work

• scientific article; zbMATH DE number 3655296 (Why is no real title available?)
• A Stabilized QMR Version of Block BiCG
• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
• A block version of BiCGSTAB for linear systems with multiple right-hand sides
• Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• Bi-CGSTAB as an induced dimension reduction method
• 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
• Convergence properties of block GMRES and matrix polynomials
• Exploiting BiCGSTAB(\(\ell\)) strategies to induce dimension reduction
• GBi-CGSTAB(\(s,L\)): IDR(\(s\)) with higher-order stabilization polynomials
• Global FOM and GMRES algorithms for matrix equations
• IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
• Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
• ML(k)BiCGSTAB: A BiCGSTAB Variant Based on Multiple Lanczos Starting Vectors
• Matrix Krylov subspace methods for linear systems with multiple right-hand sides
• Numerical Linear Algebra for High-Performance Computers
• Oblique projection methods for linear systems with multiple right-hand sides
• QMR-based projection techniques for the solution of non-Hermitian 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 Lanczos method for linear systems with multiple right-hand sides
• The block conjugate gradient algorithm and related methods
• The block grade of a block Krylov space
• The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
• The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
• Transpose-free multiple Lanczos and its application in Padé approximation
• Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme

Cited in

(22)

• The Block Rational Arnoldi Method
• IDR(s) for solving shifted nonsymmetric linear systems
• scientific article; zbMATH DE number 1735430 (Why is no real title available?)
• 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 variant of the IDR\((s)\) method with the quasi-minimal residual strategy
• A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
• Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
• Kω -- open-source library for the shifted Krylov subspace method of the form \((z I - H)x = b\)
• scientific article; zbMATH DE number 2058585 (Why is no real title available?)
• 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
• MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides

Describes a project that uses

Uses Software

• SparseMatrix

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)