Hybrid algorithm for fast Toeplitz orthogonalization (Q1094090)
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: Hybrid algorithm for fast Toeplitz orthogonalization |
scientific article; zbMATH DE number 4024622
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hybrid algorithm for fast Toeplitz orthogonalization |
scientific article; zbMATH DE number 4024622 |
Statements
Hybrid algorithm for fast Toeplitz orthogonalization (English)
0 references
1988
0 references
New techniques for fast Toeplitz QR decomposition are presented. The methods are based on the shift invariance property of a Toeplitz matrix. The numerical properties of the algorithms are discussed and some comparisons are made with two other fast Toeplitz orthogonalization methods.
0 references
fast Toeplitz QR decomposition
0 references
shift invariance
0 references
Toeplitz matrix
0 references
comparisons
0 references
fast Toeplitz orthogonalization methods
0 references
Givens rotation
0 references
Householder transformation
0 references
Cholesky factorization
0 references
least squares problem
0 references
0 references
