Improved global algorithms for maximal eigenpair

DOI10.1007/S11464-019-0799-ZzbMath1441.65036OpenAlexW2992238131WikidataQ126669377 ScholiaQ126669377MaRDI QIDQ2175470

Yue-Shuang Li, Chen Mu-Fa

Publication date: 29 April 2020

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-019-0799-z

zbMATH Keywords

maximal eigenpairpower iterationglobal algorithmshifted inverse iterationquasi-symmetrization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Stochastic stability in control theory (93E15) Iterative numerical methods for linear systems (65F10) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• Unnamed Item
• Efficient initials for computing maximal eigenpair
• Criteria on ergodicity and strong ergodicity of single death processes
• Global algorithms for maximal eigenpair
• Trilogy on computing maximal eigenpair
• Hermitizable, isospectral complex matrices or differential operators
• Development of powerful algorithm for maximal eigenpair
• Bounds for the maximal eigenvalue of a nonnegative irreducible matrix
• Sharp bounds on the spectral radius of nonnegative matrices and digraphs
• Sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and its applications
• The Charming Leading Eigenpair
• Eigenvalues, Inequalities, and Ergodic Theory
• Introduction to Stochastic Processes

This page was built for publication: Improved global algorithms for maximal eigenpair