Comparison of algorithms for Toeplitz least squares and symmetric positive definite linear systems (Q2784758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparison of algorithms for Toeplitz least squares and symmetric positive definite linear systems |
scientific article; zbMATH DE number 1732977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of algorithms for Toeplitz least squares and symmetric positive definite linear systems |
scientific article; zbMATH DE number 1732977 |
Statements
17 October 2002
0 references
numerical examples
0 references
Cholesky algorithm
0 references
Schur algorithm
0 references
Levinson algorithm
0 references
comparison of methods
0 references
Toeplitz matrices
0 references
least squares
0 references
iterative refinement method
0 references
0.8806025
0 references
0 references
0.8754046
0 references
0.8716348
0 references
0.87028474
0 references
Comparison of algorithms for Toeplitz least squares and symmetric positive definite linear systems (English)
0 references
