Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic (Q714626): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
Revision as of 16:26, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic |
scientific article |
Statements
Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic (English)
0 references
11 October 2012
0 references
The authors introduce new simple algorithms to improve the accuracy of summation, dot product and polynomial evaluation which deal with complex floating point numbers. They show that the computed results are as accurate as if computed in twice the working precision. They also provide results of some numerical experiments, where they compare different algorithms both in terms of accuracy and computing time.
0 references
complex floating point arithmetic
0 references
error-free transformations
0 references
accurate summation
0 references
accurate dot product
0 references
accurate polynomial evaluation
0 references
Horner's scheme
0 references
high precision
0 references
algorithm
0 references
numerical experiments
0 references
