Efficient computation of tridiagonal matrices largest eigenvalue

DOI10.1016/j.cam.2017.08.008zbMath1376.65048OpenAlexW2750597507MaRDI QIDQ1675958

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

tridiagonal matrixlargest eigenvaluefast algorithmpower methodnumerical result

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Uses Software

• mctoolbox
• GSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix
• Matrix multiplication via arithmetic progressions
• A fast numerical algorithm for the inverse of a tridiagonal and pentadiagonal matrix
• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Inversion of general tridiagonal matrices
• Improved bound for complexity of matrix multiplication
• Powers of tensors and fast matrix multiplication
• Fast Algorithms for Signal Processing
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
• Jacobi’s Method is More Accurate than QR
• Analytical inversion of general tridiagonal matrices
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• Accuracy and Stability of Numerical Algorithms

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