Stability analysis and fast algorithms for triangulation of Toeplitz matrices (Q1358161)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stability analysis and fast algorithms for triangulation of Toeplitz matrices |
scientific article |
Statements
Stability analysis and fast algorithms for triangulation of Toeplitz matrices (English)
0 references
30 June 1997
0 references
An algorithm for triangularizing an \(m \times n\) Toeplitz matrix is presented. This algorithm is a generalization of the classical algorithm due to Schur. In the QR decomposition of a Toeplitz matrix the new algorithm produces a more accurate R factor (upper triangular) than other existing fast methods, especially for ill-conditioned problems. In this generalized Schur algorithm, each row of the triangular factor is computed recursively via updating and downdating steps. A forward error analysis shows that the relative accuracy of the computed upper triangular factor is bounded essentially by the square condition number square of the given Toeplitz matrix, like in Cholesky decomposition. Five numerical tests are performed in order to verify the performance of the algorithm.
0 references
Toeplitz matrices
0 references
QR decomposition
0 references
stability analysis
0 references
fast algorithms
0 references
triangulation
0 references
ill-conditioned problems
0 references
Schur algorithm
0 references
error analysis
0 references
numerical examples
0 references
algorithm
0 references