Two-step Noda iteration for irreducible nonnegative matrices
From MaRDI portal
Publication:6198677
DOI10.1080/03081087.2022.2158298OpenAlexW4311874550MaRDI QIDQ6198677
Xiao Shan Chen, Unnamed Author
Publication date: 23 February 2024
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2022.2158298
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical linear algebra (65F99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Noda iterations for generalized eigenproblems following Perron-Frobenius theory
- Inverse iteration for calculating the spectral radius of a non-negative irreducible matrix
- Inexact generalized Noda iterations for generalized eigenproblems
- A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- Computing the Smallest Eigenvalue of an M-Matrix
- Two‐sided Rayleigh quotient iteration for periodic eigenvalue problems
This page was built for publication: Two-step Noda iteration for irreducible nonnegative matrices