Numerical stability of the Chebyshev method for the solution of large linear systems
From MaRDI portal
Publication:1231755
DOI10.1007/BF01394452zbMath0341.65024OpenAlexW2150997465MaRDI QIDQ1231755
Publication date: 1977
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132482
Related Items (15)
The accurate solution of certain continuous problems using only single precision arithmetic ⋮ The simplex method is not always well behaved ⋮ The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems ⋮ Round-off error analysis of iterations for large linear systems ⋮ Roundoff-error analysis of a new class of conjugate-gradient algorithms ⋮ An approach to backward analysis for linear and nonlinear iterative methods ⋮ Explicit approximate inverse preconditioning techniques ⋮ A method for the automatic evaluation of the dynamic relaxation parameters ⋮ Numerical stability of the cyclic Richardson iteration ⋮ Explicit Runge-Kutta methods for parabolic partial differential equations ⋮ Analysis of loop methods for simulating gas networks ⋮ Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations ⋮ Why does information-based complexity use the real number model? ⋮ Numerical stability of descent methods for solving linear equations ⋮ Perturbation analysis of singular linear systems with index one∗
Cites Work
This page was built for publication: Numerical stability of the Chebyshev method for the solution of large linear systems