On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1735425
- On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
- Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems
- A few results on Arnoldi's method and IOM for large non-Hermitian linear systems
- A class of incomplete orthogonal factorization methods. I: Methods and theories
Cites work
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- A block incomplete orthogonalization method for large nonsymmetric eigenproblems
- A Comparison of Preconditioned Nonsymmetric Krylov Methods on a Large-Scale MIMD Machine
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- An efficient nonsymmetric Lanczos method on parallel vector computers
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GMRESR: a family of nested GMRES methods
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Implementation of the GMRES Method Using Householder Transformations
- Iterative Solution of Linear Equations in ODE Codes
- Krylov Subspace Methods on Supercomputers
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- Orthogonal Error Methods
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Reduction to Tridiagonal Form and Minimal Realizations
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(9)- On IGMRES: An incomplete generalized minimal residual method for large unsymmetric linear systems
- Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems
- A few results on Arnoldi's method and IOM for large non-Hermitian linear systems
- Incomplete minimum joint backward perturbation methods for large unsymmetric linear systems
- scientific article; zbMATH DE number 4037031 (Why is no real title available?)
- scientific article; zbMATH DE number 4128300 (Why is no real title available?)
- The convergence of Krylov subspace methods for large unsymmetric linear systems
- scientific article; zbMATH DE number 1735425 (Why is no real title available?)
- Incompletely orthogonal variable restart parameter H-IGMRES (m) algorithm
This page was built for publication: On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4220444)
