scientific article; zbMATH DE number 1789925

MaRDI QIDQ4549236zbMATH OpenFDO

Authors James Demmel

Publication date 20 December 2002

Full work available at URL https://arxiv.org/abs/math/0305004

zbMATH Keywords

complexitymatrix factorizationscomputer arithmeticroundoff erroraccurate floating point computation

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Roundoff error (65G50)

Recommendations

• Accurate and efficient algorithms for floating point computation
• Accurate and efficient expression evaluation and linear algebra
• Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
• Necessary and sufficient conditions for accurate and efficient rational function evaluation and factorizations of rational matrices
• Accurate and reliable computing in floating-point arithmetic

Cited in

(7)

• On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents
• Accurate and reliable computing in floating-point arithmetic
• Accurate and efficient algorithms for floating point computation
• Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
• Accurate and efficient expression evaluation and linear algebra
• Complexity estimates depending on condition and round-off error
• Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic

Describes a project that uses

Uses Software

• Hull

This page was built for publication:

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