An optimal Q-OR Krylov subspace method for solving linear systems
From MaRDI portal
Publication:1744308
zbMath1392.65065MaRDI QIDQ1744308
Publication date: 23 April 2018
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol47/abstract.php?vol=47&pages=127-152
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On a variable smoothing procedure for Krylov subspace methods
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Semi-conjugate direction methods for real positive definite systems
- Necessary and sufficient conditions for GMRES complete and partial stagnation
- Global minimization of rational functions and the nearest GCDs
- Global optimization of rational functions: a semidefinite programming approach
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- Matrix Algorithms
- Geometric aspects of the theory of Krylov subspace methods
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
- Some Modified Matrix Eigenvalue Problems
- GMRES Convergence Analysis for a Convection-Diffusion Model Problem
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: An optimal Q-OR Krylov subspace method for solving linear systems
