Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices

DOI10.2307/2008616zbMath0646.65035OpenAlexW4251408337MaRDI QIDQ3790545

Dario Andrea Bini, Pan, Victor Y.

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2008616

zbMATH Keywords

computational complexityfast Fourier transformlinear recurrence relationcyclic reduction methodbanded block Toeplitz matrixlinear difference matrix equationtridiagonal block Toeplitz matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (12)

Matrix structures in parallel matrix computations ⋮ Computing eigenvalues and singular values of Toeplitz matrices ⋮ Companion matrices and their relations to Toeplitz and Hankel matrices ⋮ Formal series and an algorithm for computing some special determinants with elements in a ring ⋮ A matrix-less and parallel interpolation-extrapolation algorithm for computing the eigenvalues of preconditioned banded symmetric Toeplitz matrices ⋮ On the evaluation of the eigenvalues of a banded Toeplitz block matrix ⋮ A fast elementary algorithm for computing the determinant of Toeplitz matrices ⋮ A fast algorithm for computing the determinants of banded circulant matrices ⋮ Unnamed Item ⋮ Numerical algorithm for the determinant evaluation of cyclic pentadiagonal matrices with Toeplitz structure ⋮ An elementary algorithm for computing the determinant of pentadiagonal Toeplitz matrices ⋮ Exact solution of corner-modified banded block-Toeplitz eigensystems

Cites Work

• Unnamed Item
• Unnamed Item
• Fast parallel and sequential computations and spectral properties concerning band Toeplitz matrices
• Spectral and computational properties of band symmetric Toeplitz matrices
• On the eigenvalue problem for Toeplitz band matrices
• Determinant of block-Toeplitz band matrices
• Polynomial division and its computational complexity
• Sequential and parallel complexity of approximate evaluation of polynomial zeros

This page was built for publication: Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices