scientific article; zbMATH DE number 1789925
From MaRDI portal
Publication:4549236
For three different models of computer arithmetic, the author constructs new accurate and efficient algorithms for evaluating rational expressions containing floating point numbers, and for computing different matrix factorizations. For each computer arithmetic model, the author identifies classes of matrices for which accurate factorizations can be performed in polynomial time. Some open problems and conjectures are also posed. For the entire collection see [Zbl 0993.00023].
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)- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
- Complexity estimates depending on condition and round-off error
- Accurate and efficient expression evaluation and linear algebra
- Accurate and efficient algorithms for floating point computation
- Accurate and reliable computing in floating-point arithmetic
- On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
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)
