Probabilistic error analysis of gaussian elimination in floating point and logarithmic arithmetic

Computing ◽  
1985 ◽  
Vol 34 (4) ◽  
pp. 349-364 ◽  
Author(s):  
J. L. Barlow ◽  
E. H. Bareiss
2018 ◽  
pp. 99-120 ◽  
Author(s):  
Sana Mazahir ◽  
Muhammad Kamran Ayub ◽  
Osman Hasan ◽  
Muhammad Shafique

2016 ◽  
Vol 13 (1) ◽  
pp. 190-197
Author(s):  
Baghdad Science Journal

In this paper we present the theoretical foundation of forward error analysis of numerical algorithms under;• Approximations in "built-in" functions.• Rounding errors in arithmetic floating-point operations.• Perturbations of data.The error analysis is based on linearization method. The fundamental tools of the forward error analysis are system of linear absolute and relative a prior and a posteriori error equations and associated condition numbers constituting optimal of possible cumulative round – off errors. The condition numbers enable simple general, quantitative bounds definitions of numerical stability. The theoretical results have been applied a Gaussian elimination, and have proved to be very effective means of both a priori and a posteriori error analysis.


1985 ◽  
Vol 46 (3) ◽  
pp. 365-395 ◽  
Author(s):  
Friedrich Stummel

2012 ELEKTRO ◽  
2012 ◽  
Author(s):  
Marek Vyrostko ◽  
Peter Luley ◽  
Tomas Ondrasina ◽  
Maria Franekova

Sign in / Sign up

Export Citation Format

Share Document