New Schemes for Solving the Principal Eigenvalue Problems of Perron-like Matrices via Polynomial Approximations of Matrix Exponentials

MaRDI QIDQ6347151zbMATH OpenFDO

Authors Desheng Li, Rui-Jing Wang

Publication date 16 August 2020

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Asymptotic properties of solutions to ordinary differential equations (34D05)

Abstract: A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $mboxRe,mu<s$ for any other eigenvalue $mu$. Nonnegative matrices and symmetric ones are typical examples of this class of matrices. The main purpose of this paper is to develop a set of new schemes to compute the principal eigenvalues of Perron-like matrices and the associated generalized eigenspaces by using polynomial approximations of matrix exponentials. Numerical examples show that these schemes are effective in practice.

This page was built for publication: New Schemes for Solving the Principal Eigenvalue Problems of Perron-like Matrices via Polynomial Approximations of Matrix Exponentials

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