An error-free Levison algorithm to solve integer Toeplitz system (Q1322894)
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 566122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An error-free Levison algorithm to solve integer Toeplitz system |
scientific article; zbMATH DE number 566122 |
Statements
An error-free Levison algorithm to solve integer Toeplitz system (English)
0 references
9 October 1994
0 references
The author proposes to avoid the numerical instabilities in the Levinson algorithm for nonsymmetric Toeplitz systems by using exact arithmetic. To avoid very long integers he recommends to use modulo arithmetic. The computations can be carried out in parallel for several (or all desired) residual classes. The paper contains no explicit examples with large Toeplitz systems.
0 references
error-free Levison algorithm
0 references
integer Toeplitz system
0 references
numerical instabilities
0 references
Levinson algorithm
0 references
nonsymmetric Toeplitz systems
0 references
exact arithmetic
0 references
modulo arithmetic
0 references
0.8156930804252625
0 references
0.8007514476776123
0 references
0.7972990274429321
0 references
