Numerical solution of the eigenvalue problem for efficiently structured Hermitian matrices

DOI10.1016/0024-3795(91)90387-CzbMath0733.65020MaRDI QIDQ809543

William F. Trench

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

performancenumerical exampleseigenvaluesLevinson algorithmSturm sequencesefficiently structured Hermitian matricesFLOPS algorithmHermitian Toeplitz plus Hankel matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Related Items

A matrix-less and parallel interpolation-extrapolation algorithm for computing the eigenvalues of preconditioned banded symmetric Toeplitz matrices ⋮ A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast inversion algorithms of Toeplitz-plus-Hankel matrices
• Eigenvalues and eigenvectors of symmetric centrosymmetric matrices
• Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
• Toeplitz eigensystem solver
• Numerical Solution of the Eigenvalue Problem for Symmetric Rationally Generated Toeplitz matrices
• An Algorithm for the Inversion of Finite Hankel Matrices
• The “Pegasus” method for computing the root of an equation

This page was built for publication: Numerical solution of the eigenvalue problem for efficiently structured Hermitian matrices