IDR: a new generation of Krylov subspace methods?
DOI10.1016/J.LAA.2012.11.021zbMATH Open1305.65118OpenAlexW2098892412MaRDI QIDQ389573FDOQ389573
Authors: Olaf Rendel, Anisa Rizvanolli, Jens-Peter M. Zemke 
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.11.021
Recommendations
linear systemiterative methodKrylov subspace methodinduced dimension reductioneigenvalue computationtranspose-free method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Cites Work
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Methods of conjugate gradients for solving linear systems
- 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
- An alternative implementation of the IDRstab method saving vector updates
- Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
- Exploiting BiCGSTAB(\(\ell\)) strategies to induce dimension reduction
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- Bi-CGSTAB as an induced dimension reduction method
- GBi-CGSTAB(\(s,L\)): IDR(\(s\)) with higher-order stabilization polynomials
- Generalized conjugate gradient squared
- Title not available (Why is that?)
- Variants of BICGSTAB for Matrices with Complex Spectrum
- ML(k)BiCGSTAB: A BiCGSTAB Variant Based on Multiple Lanczos Starting Vectors
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Composite Step Product Methods for Solving Nonsymmetric Linear Systems
- Transpose-free formulations of Lanczos-type methods for nonsymmetric linear systems
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
- Quasi-minimal residual smoothing technique for the \(IDR(s)\) method
- Eigenvalue computations based on IDR
- Interpreting IDR as a Petrov-Galerkin method
- A Lanczos-type method for multiple starting vectors
- On the convergence behavior of IDR(\(s\)) and related methods
- IDR explained
Cited In (12)
- IDR explained
- A quasi-minimal residual variant of IDRstab using the residual smoothing technique
- Variants of IDR with partial orthonormalization
- Interpreting IDR as a Petrov-Galerkin method
- On the convergence behavior of IDR(\(s\)) and related methods
- A new PCCA method: IDRA
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems.
- Eigenvalue computations based on IDR
- Accelerating the induced dimension reduction method using spectral information
- A variant of IDRstab with reliable update strategies for solving sparse linear systems
- An alternative implementation of the IDRstab method saving vector updates
- Iterative processes in the Krylov-Sonneveld subspaces
Uses Software
This page was built for publication: IDR: a new generation of Krylov subspace methods?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389573)
