An enhancement of the convergence of the IDR method
From MaRDI portal
Publication:6076065
DOI10.1553/etna_vol58s470zbMath1522.65041OpenAlexW4382995914MaRDI QIDQ6076065
No author found.
Publication date: 21 September 2023
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2021-2030/vol58/abstract.php?vol=58&pages=470-485
Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items (1)
Cites Work
- A variant of the IDR\((s)\) method with the quasi-minimal residual strategy
- 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
- The block grade of a block Krylov space
- Algebraic properties of the block GMRES and block Arnoldi methods
- IDR explained
- 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
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Interpreting IDR as a Petrov–Galerkin Method
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Iterative Krylov Methods for Large Linear Systems
- Krylov Methods for Nonsymmetric Linear Systems
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An enhancement of the convergence of the IDR method
