Some acceleration techniques for calculating the eigenvalues of normal Toeplitz matrices
DOI10.1134/S0965542514120045zbMATH Open1327.65069OpenAlexW2072919379MaRDI QIDQ889203FDOQ889203
Authors: A. K. Abdikalykov, Kh. D. Ikramov, V. N. Chugunov
Publication date: 6 November 2015
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542514120045
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
numerical examplesToeplitz matrix\((T+H)\)-matrix\(\phi\)-circulantcalculation of eigenvaluesMatlab procedure eig
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Toeplitz, Cauchy, and related matrices (15B05)
Cites Work
Cited In (2)
Uses Software
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)