Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices (Q3790545): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast parallel and sequential computations and spectral properties concerning band Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral and computational properties of band symmetric Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial division and its computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and parallel complexity of approximate evaluation of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant of block-Toeplitz band matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eigenvalue problem for Toeplitz band matrices / rank
 
Normal rank

Latest revision as of 16:38, 18 June 2024

scientific article
Language Label Description Also known as
English
Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices
scientific article

    Statements

    0 references
    0 references
    1988
    0 references
    fast Fourier transform
    0 references
    computational complexity
    0 references
    banded block Toeplitz matrix
    0 references
    linear difference matrix equation
    0 references
    cyclic reduction method
    0 references
    tridiagonal block Toeplitz matrices
    0 references
    linear recurrence relation
    0 references
    Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices (English)
    0 references

    Identifiers