On the public citation graph
Estimating the Largest Eigenvalue of a Positive Definite Matrix
0 signed · 19 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471667196.ess1458openalex-snapshot
Linear Algebra, Computational
inferred← citeshttps://doi.org/10.1002/0471667196.ess1458.pub2openalex-snapshot
Linear Algebra, Computational
inferred← citeshttps://doi.org/10.1002/9781118445112.stat00459openalex-snapshot
Linear Algebra, Computational
inferred← citeshttps://doi.org/10.1002/9781118445112.stat00459.pub2openalex-snapshot
Linear Algebra, Computational
inferred← citeshttps://doi.org/10.1007/s10957-024-02538-8openalex-snapshot
Geodesic Convexity of the Symmetric Eigenvalue Problem and Convergence of Steepest Descent
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00031-7openalex-snapshot
Comparative efficiencies of domain decompositions
inferred← citeshttps://doi.org/10.1016/j.physleta.2023.129138openalex-snapshot
Quantum algorithm for estimating largest eigenvalues
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10020-4openalex-snapshot
Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix
inferred← citeshttps://doi.org/10.1063/1.3364792openalex-snapshot
Spectroscopy of drums and quantum billiards: Perturbative and nonperturbative results
inferred← citeshttps://doi.org/10.1090/s0025-5718-1982-0637293-9openalex-snapshot
On Estimating the Largest Eigenvalue with the Lanczos Algorithm
inferred← citeshttps://doi.org/10.1090/s0273-0979-1992-00239-2openalex-snapshot
Some basic information on information-based complexity theory
inferred← citeshttps://doi.org/10.1109/ijcnn.2010.5596713openalex-snapshot
A generalized Markov Chain modeling approach for on board applications
inferred← citeshttps://doi.org/10.1137/060656401openalex-snapshot
Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
inferred← citeshttps://doi.org/10.1137/0613066openalex-snapshot
Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
inferred← citeshttps://doi.org/10.1137/0720053openalex-snapshot
Estimating Extremal Eigenvalues and Condition Numbers of Matrices
inferred← citeshttps://doi.org/10.1137/110846373openalex-snapshot
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
inferred← citeshttps://doi.org/10.1145/322374.322377openalex-snapshot
Computable Error Bounds for Aggregated Markov Chains
inferred← citeshttps://doi.org/10.1145/3373758openalex-snapshot
Inhomogeneous CTMC Birth-and-Death Models Solved by Uniformization with Steady-State Detection
inferred← citeshttps://doi.org/10.32657/10356/54915openalex-snapshot
Sensing, allocation and trading of spectral resources in cognitive radio networks
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.