Johnson, Donald B.; Miller, Webb; Minnihan, Brian; Wrathall, Celia Reducibility among floating-point graphs. (English) Zbl 0441.65034 J. Assoc. Comput. Mach. 26, 739-760 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 Documents MSC: 65G50 Roundoff error 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) 65F30 Other matrix algorithms (MSC2010) 68R10 Graph theory (including graph drawing) in computer science 65F05 Direct numerical methods for linear systems and matrix inversion Keywords:numerical stability; matrix-related algorithms; graph-theoretical model; error propagations; comparing round-off in programs; floating-point graph; reducibility of graphs; robustness of the round-off model; local properties of additive graphs; LU decomposition; Gaussian elimination PDF BibTeX XML Cite \textit{D. B. Johnson} et al., J. Assoc. Comput. Mach. 26, 739--760 (1979; Zbl 0441.65034) Full Text: DOI