Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems
From MaRDI portal
Publication:1699366
DOI10.1007/s40314-016-0315-yzbMath1383.65025OpenAlexW2267105276MaRDI QIDQ1699366
Mehdi Dehghan, Reza Mohammadi-Arani
Publication date: 23 February 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-016-0315-y
algorithmnumerical exampleKrylov methodsshifted linear systemsgeneralized product-type methods based on bi-conjugate gradientquantum chrmodynamicsshifted BiCGStabshifted conjugate-gradient squared (CGS)shifted GPBiCG
Iterative numerical methods for linear systems (65F10) Strong interaction, including quantum chromodynamics (81V05)
Related Items
Single step iterative method for linear system of equations with complex symmetric positive semi-definite coefficient matrices, Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm, Adaptive parameter based matrix splitting iteration method for the large and sparse linear systems, Restarted Hessenberg method for solving shifted nonsymmetric linear systems, Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle, An iterative method based on ADMM for solving generalized Sylvester matrix equations, Generalized conjugate direction algorithm for solving general coupled Sylvester matrix equations, An efficient method for special least squares solution of the complex matrix equation \((AXB,CXD)=(E,F)\), Double parameter splitting (DPS) iteration method for solving complex symmetric linear systems, Periodic conjugate direction algorithm for symmetric periodic solutions of general coupled periodic matrix equations, On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems, Prediction-correction matrix splitting iteration algorithm for a class of large and sparse linear systems, Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously, Approximating optimal parameters for generalized preconditioned Hermitian and skew-Hermitian splitting (GPHSS) method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- BiCGStab(\(\ell\)) for families of shifted linear systems
- Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- GPBiCG(\(m,\ell\)): A hybrid of biCGSTAB and GPBiCG methods with efficiency and robustness
- Variations of Zhang's Lanczos-type product method
- Restarted full orthogonalization method for shifted linear systems
- Accurate conjugate gradient methods for families of shifted systems
- Solving linear equations with a stabilized GPBiCG method
- Krylov subspace recycling for sequences of shifted linear systems
- Numerical linear algebra aspects of control design computations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Parallel and Vector Variant of the Cyclic Reduction Algorithm
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Variants of BICGSTAB for Matrices with Complex Spectrum
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Restarted GMRES for Shifted Linear Systems
- Iterative Krylov Methods for Large Linear Systems
- Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems
