High performance algorithms for Toeplitz and block Toeplitz matrices (Q1923158): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TOEPLITZ / rank | |||
Normal rank | |||
Revision as of 14:10, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | High performance algorithms for Toeplitz and block Toeplitz matrices |
scientific article |
Statements
High performance algorithms for Toeplitz and block Toeplitz matrices (English)
0 references
7 October 1996
0 references
The authors give several high performance variants of the classical Schur algorithms to factor symmetric block Toeplitz matrices. Specifically, they discuss routines to factor symmetric positive definite, positive semidefinite, and indefinite matrices. QR factorization algorithms for rank deficient matrices are discussed. A variety of numerical examples is also given.
0 references
Schur algorithms
0 references
high performance computing
0 references
block Toeplitz matrices
0 references
QR factorization algorithms
0 references
numerical examples
0 references
