No label defined (Q4549236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1789925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1789925 |
Statements
20 December 2002
0 references
roundoff error
0 references
complexity
0 references
computer arithmetic
0 references
matrix factorizations
0 references
accurate floating point computation
0 references
0.8625258803367615
0 references
0.8027379512786865
0 references
0.7976704835891724
0 references
0.7924686670303345
0 references
0.78033447265625
0 references
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].
0 references
