A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix (Q3588914): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Extreme eigenvalues of real symmetric Toeplitz matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recurrence relations for the even and odd characteristic polynomials of a symmetric Toeplitz matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computation of the Newton step for the even and odd characteristic polynomials of a symmetric positive definite Toeplitz matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4265495 / rank | |||
Normal rank | |||
Latest revision as of 05:00, 3 July 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
0 references
