An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
From MaRDI portal
Publication:5340360
DOI10.1093/comjnl/6.2.202zbMath0131.33901OpenAlexW2333597828MaRDI QIDQ5340360
Publication date: 1963
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/6.2.202
Related Items
Polynomial Preconditioned GMRES and GMRES-DR ⋮ A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß ⋮ s-step iterative methods for symmetric linear systems ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ Computational methods of linear algebra ⋮ GMRES algorithms over 35 years ⋮ Acceleration of the scheduled relaxation Jacobi method: promising strategies for solving large, sparse linear systems ⋮ On numerical stability in large scale linear algebraic computations ⋮ Anderson acceleration of the Jacobi iterative method: an efficient alternative to Krylov methods for large, sparse linear systems ⋮ On the asymptotic directions of the s-dimensional optimum gradient method ⋮ Iterative solution of linear systems in the 20th century
