Efficient computation of tridiagonal matrices largest eigenvalue

DOI10.1016/J.CAM.2017.08.008MaRDI QIDQ1675958zbMATH OpenOpenAlexFDO

Authors Diego F. G. Coelho, Vassil S. Dimitrov, Logan Rakai

Publication date 3 November 2017

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2017.08.008

zbMATH Keywords

fast algorithmnumerical resultlargest eigenvaluetridiagonal matrixpower method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Computing the maximal eigenpairs of large size tridiagonal matrices with \(\mathcal{O} (1)\) number of iterations
• An Inverse Extreme Eigenpair Problem and Its Parallel Iterative Solution for Symmetric Tridiagonal Matrices
• The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
• Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method
• An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach

Cites work

• scientific article; zbMATH DE number 613026 (Why is no real title available?)
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• scientific article; zbMATH DE number 3045283 (Why is no real title available?)
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• A fast numerical algorithm for the inverse of a tridiagonal and pentadiagonal matrix
• Accuracy and Stability of Numerical Algorithms
• Analytical inversion of general tridiagonal matrices
• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• Fast algorithms for signal processing.
• Improved bound for complexity of matrix multiplication
• Inversion of general tridiagonal matrices
• Jacobi’s Method is More Accurate than QR
• Matrix multiplication via arithmetic progressions
• Powers of tensors and fast matrix multiplication
• Tridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix

Cited in

(3)

• Computing the maximal eigenpairs of large size tridiagonal matrices with \(\mathcal{O} (1)\) number of iterations
• The interesting spectral interlacing property for a certain tridiagonal matrix
• A Truncated RQ Iteration for Large Scale Eigenvalue Calculations

Describes a project that uses

Uses Software

• GSL
• mctoolbox

This page was built for publication: Efficient computation of tridiagonal matrices largest eigenvalue

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