A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
From MaRDI portal
Publication:2252728
DOI10.1016/j.cam.2013.06.014zbMath1291.65105OpenAlexW2050208221MaRDI QIDQ2252728
Jing Meng, Hou-Biao Li, Pei-Yong Zhu
Publication date: 23 July 2014
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.2013.06.014
truncationmultiple right-hand sidesblock Krylov subspace methodflexible preconditioningblock \(\mathrm{GCROT}(m, k)\)
Related Items
Recycling Krylov subspaces for CFD applications and a new hybrid recycling solver ⋮ An ensemble scheme for the numerical solution of a random transient heat equation with uncertain inputs ⋮ A survey of subspace recycling iterative methods ⋮ A Multilevel Monte Carlo Ensemble Scheme for Random Parabolic PDEs ⋮ Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems ⋮ The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides ⋮ Solution methods for linear discrete ill-posed problems for color image restoration ⋮ A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations ⋮ A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short-recurrence Krylov subspace methods for the overlap Dirac operator at nonzero chemical potential
- A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
- Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- A nested Krylov subspace method to compute the sign function of large complex matrices
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Simpler block GMRES for nonsymmetric systems with multiple right-hand sides
- Exact and inexact breakdowns in the block GMRES method
- Oblique projection methods for linear systems with multiple right-hand sides
- 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
- The block Lanczos method for linear systems with multiple right-hand sides
- Nested Krylov methods based on GCR
- Skew-symmetric methods for nonsymmetric linear systems with multiple right-hand sides
- Dynamic block GMRES: An iterative method for block linear systems
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- Convergence properties of block GMRES and matrix polynomials
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- Flexible Variants of Block Restarted GMRES Methods with Application to Geophysics
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
- The university of Florida sparse matrix collection
- Algorithm 913
- Flexible GMRES with Deflated Restarting
- Exploiting BiCGstab($\ell$) Strategies to Induce Dimension Reduction
- A Simplified and Flexible Variant of GCROT for Solving Nonsymmetric Linear Systems
- A Flexible Generalized Conjugate Residual Method with Inner Orthogonalization and Deflated Restarting
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Truncation Strategies for Optimal Krylov Subspace Methods
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- On Improving Linear Solver Performance: A Block Variant of GMRES
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
