Round-off error analysis of iterations for large linear systems

DOI10.1007/BF01411845zbMath0425.65018OpenAlexW2123253921MaRDI QIDQ1135609

Henryk Woźniakowski

Publication date: 1978

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132552

zbMATH Keywords

SORround-off errorlarge linear systemsJacobiGauss-SeidelRichardsonsuccessive approximation iterations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Roundoff error (65G50)

Related Items

Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration, The bit-cost of some algorithms for the solution of linear systems, Numerical stability of a cyclic adi iteration, Roundoff-error analysis of a new class of conjugate-gradient algorithms, How to minimize the cost of iterative methods in the presence of perturbations, Block-iterative methods for consistent and inconsistent linear equations, Why does information-based complexity use the real number model?, Numerical stability of descent methods for solving linear equations, Finite precision behavior of stationary iteration for solving singular systems

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical stability of the Chebyshev method for the solution of large linear systems
• Bounds for the round-off errors in the richardson second order method
• Iterative refinement implies numerical stability