Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides

DOI10.1007/S40314-014-0188-XzbMATH Open1339.65051OpenAlexW2022697411MaRDI QIDQ291379FDOQ291379

Hua Dai, Jianhua Zhang

Publication date: 7 June 2016

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-014-0188-x

Recommendations

• A new family of global methods for linear systems with multiple right-hand sides
• Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis
• Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis
• scientific article; zbMATH DE number 7027635
• scientific article; zbMATH DE number 5630367

zbMATH Keywords

numerical experimentcomplex spectrumGl-BiCGSTABGl-GPBiCGmatrix Krylov subspace methodmultiple right-hand sidesnon-symmetric linear systemsproduct-type method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• The university of Florida sparse matrix collection
• GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
• ILUT: A dual threshold incomplete LU factorization
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• An extension of the conjugate residual method to nonsymmetric linear systems
• A new family of global methods for linear systems with multiple right-hand sides
• Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
• New convergence results on the global GMRES method for diagonalizable matrices
• 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
• Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides
• CG-type algorithms to solve symmetric matrix equations
• Convergence properties of block GMRES and matrix polynomials
• Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
• Matrix Krylov subspace methods for linear systems with multiple right-hand sides
• Stability of GPBiCG_AR Method Based on Minimization of Associate Residual
• Title not available (Why is that?)
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• 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
• Generalized global conjugate gradient squared algorithm

Cited In (3)

• A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\)
• Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis
• Global GPBiCGstab\((L)\) method for solving linear matrix equations

Uses Software

• SparseMatrix
• GpBiCg
• ILUT

This page was built for publication: Global GPBiCG method for complex non-Hermitian 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 Q291379)