A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix
From MaRDI portal
Publication:1307219
DOI10.1016/S0024-3795(97)10028-3zbMath0936.65043OpenAlexW2035829631MaRDI QIDQ1307219
Heinrich Voss, Wolfgang Mackens
Publication date: 28 October 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(97)10028-3
Related Items (2)
A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix ⋮ Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix
Cites Work
- A new algorithm for solving Toeplitz systems of equations
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Downdating of Szegö polynomials and data-fitting applications
- Numerical experience with a superfast real Toeplitz solver
- Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
- Stability of Methods for Solving Toeplitz Systems of Equations
- Toeplitz eigensystem solver
- Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- Circulant and Skewcirculant Matrices for Solving Toeplitz Matrix Problems
- Recursive and iterative algorithms for computing eigenvalues of Hermitian Toeplitz matrices
- The Minimum Eigenvalue of a Symmetric Positive-Definite Toeplitz Matrix and Rational Hermitian Interpolation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix
