A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix (Q3588914): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Nicola Mastronardi / rank
Normal rank
 
Property / author
 
Property / author: Raf Vandebril / rank
Normal rank
 
Property / author
 
Property / author: Nicola Mastronardi / rank
 
Normal rank
Property / author
 
Property / author: Raf Vandebril / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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 02: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
    0 references
    0 references
    0 references
    0 references
    10 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    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