QR factorization of Toeplitz matrices (Q1063382): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Adam W. Bojanczyk / rank | |||
| Property / author | |||
| Property / author: Richard P. Brent / rank | |||
| Property / author | |||
| Property / author: Q489284 / rank | |||
| Property / author | |||
| Property / author: Adam W. Bojanczyk / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Richard P. Brent / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Frank R. de Hoog / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stability of Methods for Solving Toeplitz Systems of Equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Methods for Modifying Matrix Factorizations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4879581 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Toeplitz orthogonalization / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059885882 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:20, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | QR factorization of Toeplitz matrices |
scientific article |
Statements
QR factorization of Toeplitz matrices (English)
0 references
1986
0 references
This paper presents a new algorithm for computing the QR factorization of an \(m\times n\) Toeplitz matrix in O(mn) operations. The algorithm exploits the procedure for the rank-1 modification and the fact that both principal (m-1)\(\times (n-1)\) submatrices of the Toeplitz matrix are identical.
0 references
Toeplitz matrix
0 references
orthogonal factorization
0 references
QR factorization
0 references
rank-1 modification
0 references
computational complexity
0 references
numerical stability
0 references
least squares
0 references
Cholesky factorization
0 references
Sweet's algorithm
0 references
