Efficient initials for computing maximal eigenpair

DOI10.1007/s11464-016-0573-4zbMath1372.65105arXiv1609.01358OpenAlexW2510417816MaRDI QIDQ335562

Chen Mu-Fa

Publication date: 2 November 2016

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

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

zbMATH Keywords

algorithmnumerical exampleseigenvectorstochastic stabilitytridiagonal matrixPerron-Frobenius theorem\(Q\)-matrixefficient initialmaximal eigenpairpower iterationRayleigh quotient iteration

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Stochastic stability in control theory (93E15) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (7)

Approximation theorem for principle eigenvalue of discrete \(p\)-Laplacian ⋮ Improved global algorithms for maximal eigenpair ⋮ Global algorithms for maximal eigenpair ⋮ Hermitizable, isospectral complex matrices or differential operators ⋮ Efficient algorithm for principal eigenpair of discrete \(p\)-Laplacian ⋮ Computing top eigenpairs of Hermitizable matrix ⋮ Development of powerful algorithm for maximal eigenpair

Cites Work

• Isospectral operators
• Speed of stability for birth-death processes
• Unified speed estimation of various stabilities
• Explicit bounds of the first eigenvalue.
• Variational formulas and approximation theorems for the first eigenvalue in dimension one
• Unified representation of formulas for single birth processes
• Criteria for discrete spectrum of 1D operators
• Eigenvalues, Inequalities, and Ergodic Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient initials for computing maximal eigenpair