Reducibility Among Floating-Point Graphs
DOI10.1145/322154.322164zbMath0441.65034MaRDI QIDQ3883381
Webb Miller, Brian Minnihan, Donald B. Johnson, Celia Wrathall
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322154.322164
Gaussian elimination; numerical stability; LU decomposition; graph-theoretical model; comparing round-off in programs; error propagations; floating-point graph; local properties of additive graphs; matrix-related algorithms; reducibility of graphs; robustness of the round-off model
68R10: Graph theory (including graph drawing) in computer science
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
65G50: Roundoff error
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items