Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix

DOI10.1007/BF01436087zbMath0226.65026OpenAlexW2079401131MaRDI QIDQ2549227

Takashi Noda

Publication date: 1971

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132084

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (19)

Exact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensor ⋮ A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor ⋮ Solving multi-linear systems with \(\mathcal {M}\)-tensors ⋮ Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor ⋮ On the Perron root and eigenvectors associated with a subshift of finite type ⋮ Newton--Noda Iteration for Computing the Ground States of Nonlinear Schrödinger Equations ⋮ A note on Newton-Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor ⋮ Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor ⋮ Noda iteration for computing generalized tensor eigenpairs ⋮ A positivity preserving iterative method for finding the ground states of saturable nonlinear Schrödinger 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 ⋮ Zur Bestimmung der Frobeniuswurzel nichtnegativer Matrizen ⋮ Inverse iteration for calculating the spectral radius of a non-negative irreducible matrix ⋮ Reguläre Zerlegung und Berechnung des Spektralradius nichtnegativer Matrizen ⋮ Newton-based methods for finding the positive ground state of Gross-Pitaevskii equations ⋮ Inexact generalized Noda iterations for generalized eigenproblems ⋮ A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix

Cites Work

• Unnamed Item
• On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. V: Usual Rayleigh quotient for non-Hermitian matrices and linear elementary divisors. VI: Usual Rayleigh quotient for nonlinear elementary divisors

This page was built for publication: Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix