Computing the Smallest Eigenvalue of an M-Matrix
From MaRDI portal
Recommendations
- Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix
- A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
- scientific article; zbMATH DE number 3925012
- Bounds for the minimum eigenvalue of nonsingular M-matrix
Cited in
(10)- 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
- Accurate solutions of \(M\)-matrix Sylvester equations
- Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix
- scientific article; zbMATH DE number 3925012 (Why is no real title available?)
- scientific article; zbMATH DE number 5221528 (Why is no real title available?)
- Computation of Smallest Eigenvalues using Spectral Schur Complements
- Two-step Noda iteration for irreducible nonnegative matrices
- Noda iterations for generalized eigenproblems following Perron-Frobenius theory
This page was built for publication: Computing the Smallest Eigenvalue of an M-Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717291)