Trilogy on computing maximal eigenpair

DOI10.1007/978-3-319-68520-5_19MaRDI QIDQ1703996zbMATH OpenOpenAlexFDO

Authors Mu-Fa Chen

Publication date 8 March 2018

Full work available at URL https://arxiv.org/abs/1711.09006

zbMATH Keywords

eigenvectortridiagonal matrixefficient initialmaximal eigenpairirreducible matricesglobal algorithm

Mathematics Subject Classification ID

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

Abstract: The eigenpair here means the twins consist of eigenvalue and its eigenvector. This paper introduces the three steps of our study on computing the maximal eigenpair. In the first two steps, we construct efficient initials for a known but dangerous algorithm, first for tridiagonal matrices and then for irreducible matrices, having nonnegative off-diagonal elements. In the third step, we present two global algorithms which are still efficient and work well for a quite large class of matrices, even complex for instance.

Recommendations

• Global algorithms for maximal eigenpair
• Efficient initials for computing maximal eigenpair
• Finding the Maximal Eigenpair for a Large, Dense, Symmetric Matrix based on Mufa Chen's Algorithm
• Development of powerful algorithm for maximal eigenpair
• Computing the maximal eigenpairs of large size tridiagonal matrices with \(\mathcal{O} (1)\) number of iterations

Cited in

(7)

• Hermitizable, isospectral complex matrices or differential operators
• The charming leading eigenpair
• Computing the maximal eigenpairs of large size tridiagonal matrices with \(\mathcal{O} (1)\) number of iterations
• Improved global algorithms for maximal eigenpair
• Efficient initials for computing maximal eigenpair
• Development of powerful algorithm for maximal eigenpair
• Global algorithms for maximal eigenpair

This page was built for publication: Trilogy on computing maximal eigenpair

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