arXiv:1512.04246 [math.NA]AbstractReferencesReviewsResources
Numerical stability of iterative refinement with a relaxation for linear systems
Alicja Smoktunowicz, Jakub Kierzkowski, Iwona Wrobel
Published 2015-12-14Version 1
Stability analysis of Wilkinson's iterative refinement with a relaxation IR(omega) for solving linear systems is given. It extends existing results for omega=1, i.e., for Wilkinson's iterative refinement. We assume that all computations are performed in fixed (working) precision arithmetic. Numerical tests were done in MATLAB to illustrate our theoretical results. A particular emphasis is given on convergence of iterative refinement with a relaxation. Our tests confirm that the choice omega=1 is the best choice from the point of numerical stability.
Comments: 12 pages
Categories: math.NA
Related articles: Most relevant | Search more
On the numerical stability of Fourier extensions
arXiv:2207.08769 [math.NA] (Published 2022-07-18)
Numerical stability and tensor nuclear norm
Numerical Stability and Catalan Numbers