On the numerical evaluation of linear recurrences (Q1863682)
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 1880337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the numerical evaluation of linear recurrences |
scientific article; zbMATH DE number 1880337 |
Statements
On the numerical evaluation of linear recurrences (English)
0 references
12 March 2003
0 references
Investigation of the rounding errors for the evaluation of \(n\)-term linear recurrences of order \(m+1\). For several examples the new result is compared with the exact error and an old estimate. Then the parallel evaluation of the last term of a recurrence is discussed with an algorithm based on Stone's algorithm. Speedup examples on a T3E are presented for different values of \(m,n\) and number of processors up to 512.
0 references
linear recurrence relations
0 references
rounding errors
0 references
parallel algorithms
0 references
Stone's algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.7932525873184204
0 references
0.7868920564651489
0 references
0.7821114659309387
0 references
