Some acceleration techniques for calculating the eigenvalues of normal Toeplitz matrices
From MaRDI portal
(Redirected from Publication:889203)
Recommendations
- Some acceleration methods for iterative computer of derivatives of eigenvalues and eigenvectors
- Fast algorithms for calculating the eigenvalues of normal Hankel matrices
- Fast algorithm for computing eigenvalue of Toeplitz periodic tridiagonal matrices
- Fast Toeplitz eigenvalue computations, joining interpolation-extrapolation matrix-less algorithms and simple-loop theory
- Accelerating Computation of Eigenvectors in the Dense Nonsymmetric Eigenvalue Problem
- Fast computation of the matrix exponential for a Toeplitz matrix
- Computing eigenvalues and singular values of Toeplitz matrices
- Acceleration of inexact inverse iteration for eigenvalue problems
- An acceleration method for computing the generalized eigenvalue problem on a parallel computer
- Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices
Cites work
- scientific article; zbMATH DE number 4037022 (Why is no real title available?)
- A Hermitian Toeplitz matrix is unitarily similar to a real Toeplitz-plus-Hankel matrix
- A criterion for the normality of a complex Toeplitz matrix
- On the unitary similarity of Hermitian Toeplitz matrices to real \((T+H)\)- matrices
Cited in
(2)
This page was built for publication: Some acceleration techniques for calculating the eigenvalues of normal Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889203)