Reducibility Among Floating-Point Graphs

DOI10.1145/322154.322164MaRDI QIDQ3883381zbMATH OpenOpenAlexFDO

Authors Donald B. Johnson, Webb Miller, Brian Minnihan, 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

zbMATH Keywords

comparing round-off in programserror propagationsfloating-point graphGaussian eliminationgraph-theoretical modellocal properties of additive graphsLU decompositionmatrix-related algorithmsnumerical stabilityreducibility of graphsrobustness of the round-off model

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Roundoff error (65G50) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(3)

• Algorithms for roundoff error analysis - a relative error approach
• A remark on gradual underflow
• Roundoff analyses and sparse data

This page was built for publication: Reducibility Among Floating-Point Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883381)