Modified Lanczos method for solving large sparse linear systems
From MaRDI portal
Publication:3136843
DOI10.1002/cnm.1640090111zbMath0782.65047OpenAlexW2106758921MaRDI QIDQ3136843
Publication date: 6 October 1993
Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cnm.1640090111
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (1)
Cites Work
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- The Lanczos Algorithm With Partial Reorthogonalization
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations
- The Lanczos Algorithm with Selective Orthogonalization
- Computational Variants of the Lanczos Method for the Eigenproblem
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Modified Lanczos method for solving large sparse linear systems