Noda iterations for generalized eigenproblems following Perron-Frobenius theory

DOI10.1007/S11075-018-0512-4MaRDI QIDQ670491zbMATH OpenOpenAlexWikidataFDO

Authors Seak-Weng Vong, Wen Li, Xiao Shan Chen, Hongguo Xu

Publication date 18 March 2019

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-018-0512-4

zbMATH Keywords

generalized eigenproblem, generalized Noda iteration, nonnegative irreducible matrix, M-matrix, quadratic convergence, Perron-Frobenius theory

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical linear algebra (65F99)

Recommendations

• Inexact generalized Noda iterations for generalized eigenproblems
• Two-step Noda iteration for irreducible nonnegative matrices
• Noda iteration for computing generalized tensor eigenpairs
• 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

Cites work

• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
• A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
• Computing the Smallest Eigenvalue of an M-Matrix
• Inverse iteration for calculating the spectral radius of a non-negative irreducible matrix
• Matrix algorithms. Vol. 2: Eigensystems
• Matrix theory
• Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix
• Perron-frobenius theory for a generalized eigenproblem
• Sign-preserving of principal eigenfunctions in P1 finite element approximation of eigenvalue problems of second-order elliptic operators
• Templates for the Solution of Algebraic Eigenvalue Problems
• The Frobenius theorem, its Solow-Samuelson extension and the Kuhn-Tucker theorem

Cited in

(4)

• Inexact generalized Noda iterations for generalized eigenproblems
• Noda iteration for computing generalized tensor eigenpairs
• Two-step Noda iteration for irreducible nonnegative matrices
• Harmonic analysis on graphs via Bratteli diagrams and path-space measures

Describes a project that uses

Uses Software

• JDQZ
• JDQR

This page was built for publication: Noda iterations for generalized eigenproblems following Perron-Frobenius theory

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