Numerical solution of the eigenvalue problem for efficiently structured Hermitian matrices

DOI10.1016/0024-3795(91)90387-CMaRDI QIDQ809543zbMATH OpenFDO

Authors William F. Trench

Publication date 1991

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

zbMATH Keywords

performanceeigenvaluesnumerical examplesLevinson algorithmSturm sequencesefficiently structured Hermitian matricesFLOPS algorithmHermitian Toeplitz plus Hankel matrices

Mathematics Subject Classification ID

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

Recommendations

• Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
• A real isotropic Lanczos algorithm for eigenproblem of complex Hermite matrix
• Numerical Solution of the Eigenproblem for Banded, Symmetric Toeplitz Matrices
• Fast algorithms for calculating the eigenvalues of normal Hankel matrices
• scientific article; zbMATH DE number 2063914

Cites work

• scientific article; zbMATH DE number 3945248 (Why is no real title available?)
• scientific article; zbMATH DE number 3635377 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• An Algorithm for the Inversion of Finite Hankel Matrices
• Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
• Eigenvalues and eigenvectors of symmetric centrosymmetric matrices
• Fast inversion algorithms of Toeplitz-plus-Hankel matrices
• Numerical Solution of the Eigenvalue Problem for Symmetric Rationally Generated Toeplitz matrices
• The “Pegasus” method for computing the root of an equation
• Toeplitz eigensystem solver

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809543)