A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix (Q3588914): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:11, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix |
scientific article |
Statements
A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix (English)
0 references
10 September 2010
0 references
Toeplitz matrix
0 references
symmetric positive-definite matrix
0 references
generalized Schur algorithm
0 references
smallest eigenvalues
0 references
signal processing
0 references
