On the public citation graph
Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix
0 signed · 31 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00284194openalex-snapshot
On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. V
inferredcites →https://doi.org/10.1007/bf00298007openalex-snapshot
On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01396060openalex-snapshot
Regul�re Zerlegungen und Berechnung des Spektralradius nichtnegativer Matrizen
inferred← citeshttps://doi.org/10.1007/bf02242303openalex-snapshot
Zur Bestimmung der Frobeniuswurzel nichtnegativer Matrizen
inferred← citeshttps://doi.org/10.1007/s00211-014-0677-2openalex-snapshot
A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible $$M$$ M -matrix
inferred← citeshttps://doi.org/10.1007/s00211-017-0869-7openalex-snapshot
Newton–Noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
inferred← citeshttps://doi.org/10.1007/s10915-015-0156-7openalex-snapshot
Solving Multi-linear Systems with $$\mathcal {M}$$ M -Tensors
inferred← citeshttps://doi.org/10.1007/s10915-020-01297-8openalex-snapshot
A Positivity Preserving Iterative Method for Finding the Ground States of Saturable Nonlinear Schrödinger Equations
inferred← citeshttps://doi.org/10.1007/s10915-021-01711-9openalex-snapshot
Newton-Based Methods for Finding the Positive Ground State of Gross-Pitaevskii Equations
inferred← citeshttps://doi.org/10.1007/s10915-022-01852-5openalex-snapshot
Exact and Inexact Iterative Methods for Finding the Largest Eigenpair of a Weakly Irreducible Nonnegative Tensor
inferred← citeshttps://doi.org/10.1007/s11075-018-0512-4openalex-snapshot
Noda iterations for generalized eigenproblems following Perron-Frobenius theory
inferred← citeshttps://doi.org/10.1016/0024-3795(76)90029-xopenalex-snapshot
Inverse iteration for calculating the spectral radius of a non-negative irreducible matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90258-8openalex-snapshot
On a class of methods for the computation of the spectral radius and the Perron vector of a nonnegative, irreducible matrix
inferred← citeshttps://doi.org/10.1016/j.aml.2023.108861openalex-snapshot
A note on Newton–Noda iteration for computing the Perron pair of a weakly irreducible nonnegative tensor
inferred← citeshttps://doi.org/10.1016/j.cam.2019.02.014openalex-snapshot
Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor
inferred← citeshttps://doi.org/10.1016/j.cam.2019.112418openalex-snapshot
Inexact generalized Noda iterations for generalized eigenproblems
inferred← citeshttps://doi.org/10.1016/j.cam.2023.115284openalex-snapshot
Noda iteration for computing generalized tensor eigenpairs
inferred← citeshttps://doi.org/10.1016/j.laa.2021.10.003openalex-snapshot
On the Perron root and eigenvectors associated with a subshift of finite type
inferred← citeshttps://doi.org/10.1080/03081087.2022.2158298openalex-snapshot
Two-step Noda iteration for irreducible nonnegative matrices
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01325-4openalex-snapshot
Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix
inferred← citeshttps://doi.org/10.1137/0614032openalex-snapshot
On Accurate Computations of the Perron Root
inferred← citeshttps://doi.org/10.1137/15m1040128openalex-snapshot
A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
inferred← citeshttps://doi.org/10.1137/21m1435793openalex-snapshot
Newton--Noda Iteration for Computing the Ground States of Nonlinear Schrödinger Equations
inferred← citeshttps://doi.org/10.1137/s0895479894276953openalex-snapshot
Computing the Smallest Eigenvalue of an M-Matrix
inferred← citeshttps://doi.org/10.3390/math12162546openalex-snapshot
An Inexact Noda Iteration for Computing the Smallest Eigenpair of a Large, Irreducible Monotone Matrix
inferred← citeshttps://doi.org/10.48550/arxiv.1309.3926openalex-snapshot
A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible M-matrix
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02197openalex-snapshot
An inexact Noda iteration for computing the smallest eigenpair of a large irreducible monotone matrix
inferred← citeshttps://doi.org/10.48550/arxiv.2008.06850openalex-snapshot
New Schemes for Solving the Principal Eigenvalue Problems of Perron-like Matrices via Polynomial Approximations of Matrix Exponentials
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.