Efficient computation of tridiagonal matrices largest eigenvalue

This paper proposes a method for a fast estimation of the largest eigenvalue of an asymmetric tridiagonal matrix. The proposed method is based on the Power method and the computation of the square of the original matrix. The matrix square is computed through a proposed fast algorithm designed specif...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics 2018-03, Vol.330, p.268-275
Main Authors: Coelho, Diego F.G., Dimitrov, Vassil S., Rakai, L.
Format: Article
Language:English
Subjects:
Eigenvalue
Fast algorithm
Power method
Tridiagonal matrix
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a method for a fast estimation of the largest eigenvalue of an asymmetric tridiagonal matrix. The proposed method is based on the Power method and the computation of the square of the original matrix. The matrix square is computed through a proposed fast algorithm designed specifically for tridiagonal matrices. Implementations for compressed column (CCS) and compressed row storage (CRS) formats are provided, discussed and compared to a standard scientific library. We investigate the roundoff numerical errors, showing that the proposed method provides errors no greater than the usual Power method. We provide numerical results with simulations in C/C++ implementation in order to demonstrate the effectiveness of the proposed method.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2017.08.008