Computing the Maximal Eigenvalue and Eigenvector of a Positive Matrix

DOI10.1137/0705023MaRDI QIDQ5539403zbMATH OpenOpenAlexFDO

Authors Thomas A. Porsching, Charles Allan Hall

Publication date 1968

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0705023

zbMATH Keywords

numerical analysis

Cited in

(6)

• Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
• Verfahren zur Berechnung des Spektralradius nichtnegativer irreduzibler Matrizen. (A method for calculating the spectral radius of non-negative irreducible matrices)
• Verfahren zur Berechnung des Spektralradius nichtnegativer irreduzibler Matrizen. II. (A method for calculating the spectral radius of non- negative irreducible matrices. II)
• Diagonal transformation methods for computing the maximal eigenvalue and eigenvector of a nonnegative irreducible matrix
• On accelerated monotone iterations for numerical solutions of semilinear elliptic boundary value problems
• Zur Bestimmung der Frobeniuswurzel nichtnegativer Matrizen

This page was built for publication: Computing the Maximal Eigenvalue and Eigenvector of a Positive Matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5539403)