A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix (Q3588914): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nla.565 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2137972509 / rank | |||
Normal rank | |||
Revision as of 01:00, 20 March 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
