On the public citation graph

On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. V

https://doi.org/10.1007/bf00284194
0 signed · 21 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nla.2422openalex-snapshot
Two‐sided Rayleigh quotient iteration for periodic eigenvalue problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22453-9_14openalex-snapshot
Mode Selecting Eigensolvers for 3D Computational Models
inferred← citeshttps://doi.org/10.1007/bf01436087openalex-snapshot
Note on the computation of the maximal eigenvalue of a non-negative irreducible matrix
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.1016/0010-4655(89)90146-xopenalex-snapshot
A generalized nonsymmetric Lanczos procedure
inferred← citeshttps://doi.org/10.1016/0021-9991(75)90119-9openalex-snapshot
Iterative eigenvalue algorithms based on convergent splittings
inferred← citeshttps://doi.org/10.1016/0024-3795(73)90022-0openalex-snapshot
An inclusion theorem related to inverse iteration
inferred← citeshttps://doi.org/10.1016/0096-3003(94)90155-4openalex-snapshot
Efficient computation of eigenvalues of randomly generated matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2006.06.055openalex-snapshot
A note on the approximation of two-sided Rayleigh quotient to eigenvalues
inferred← citeshttps://doi.org/10.1016/s0022-460x(74)80106-9openalex-snapshot
Application of the Rayleigh quotient to eigenvalue problems of pseudo-conservative systems
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00494-3openalex-snapshot
Two-sided and alternating Jacobi–Davidson
inferred← citeshttps://doi.org/10.1016/s0041-5553(89)80032-1openalex-snapshot
Numerical method for solving the eigenvalue problem for sparse matrices depending non-linearly on a spectral parameter
inferred← citeshttps://doi.org/10.1063/1.1674615openalex-snapshot
Higher-Order Finite Difference Solutions of the Schrödinger Equation for the Helium Atom
inferred← citeshttps://doi.org/10.1109/tkde.2019.2949309openalex-snapshot
Absorbing Diagonal Algorithm: an Eigensolver of $O(n^{2.584963} \log\frac{1}{\epsilon})$ Complexity at Precision ε
inferred← citeshttps://doi.org/10.1137/090774604openalex-snapshot
A Multilevel Jacobi–Davidson Method for Polynomial PDE Eigenvalue Problems Arising in Plasma Physics
inferred← citeshttps://doi.org/10.1137/15m1049956openalex-snapshot
Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method
inferred← citeshttps://doi.org/10.1137/s0036144599363084openalex-snapshot
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
inferred← citeshttps://doi.org/10.1515/cmam-2018-0025openalex-snapshot
Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials
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
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.