Computing the Smallest Eigenvalue of an M-Matrix
From MaRDI portal
Publication:4717291
DOI10.1137/S0895479894276953zbMath0863.65015OpenAlexW2033430390MaRDI QIDQ4717291
Publication date: 8 June 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479894276953
algorithmstabilitynumerical exampleperturbation theoryeigenvectorsmallest eigenvaluebackward errorirreducible nonsingular \(\text{M}\)-matrix
Related Items
Accurate solutions of \(M\)-matrix Sylvester equations ⋮ Two-step Noda iteration for irreducible nonnegative matrices ⋮ Noda iterations for generalized eigenproblems following Perron-Frobenius theory ⋮ Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix ⋮ An inequality for the Perron pair of an irreducible and symmetric nonnegative tensor with application ⋮ Inexact generalized Noda iterations for generalized eigenproblems ⋮ A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
This page was built for publication: Computing the Smallest Eigenvalue of an M-Matrix