On the public citation graph

On adaptively accelerated Arnoldi method for computing PageRank

0 signed · 47 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nla.531openalex-snapshot
A Power–Arnoldi algorithm for computing PageRank
inferredcites →https://doi.org/10.1002/nla.708openalex-snapshot
Square and stretch multigrid for stochastic matrix eigenproblems
inferredcites →https://doi.org/10.1007/978-94-011-5412-3_5openalex-snapshot
Implicitly Restarted Arnoldi/Lanczos Methods for Large Scale Eigenvalue Calculations
inferredcites →https://doi.org/10.1007/s10543-006-0091-yopenalex-snapshot
An Arnoldi-type algorithm for computing page rank
inferredcites →https://doi.org/10.1016/b978-044482107-2/50003-0openalex-snapshot
Implicitly restarted arnoldi/lanczos methods and large scale svd applications
inferredcites →https://doi.org/10.1016/j.amc.2005.08.035openalex-snapshot
Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
inferredcites →https://doi.org/10.1016/j.laa.2003.12.008openalex-snapshot
Adaptive methods for the computation of PageRank
inferredcites →https://doi.org/10.1016/s0024-3795(96)00238-8openalex-snapshot
Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
inferredcites →https://doi.org/10.1023/a:1019177600806openalex-snapshot
Weighted FOM and GMRES for solving nonsymmetric linear systems
inferredcites →https://doi.org/10.1080/15427951.2004.10129091openalex-snapshot
Deeper Inside PageRank
inferredcites →https://doi.org/10.1080/15427951.2005.10129098openalex-snapshot
A Survey on PageRank Computing
inferredcites →https://doi.org/10.1090/qam/42792openalex-snapshot
The principle of minimized iterations in the solution of the matrix eigenvalue problem
inferredcites →https://doi.org/10.1137/040607551openalex-snapshot
A Reordering for the PageRank Problem
inferredcites →https://doi.org/10.1137/070685142openalex-snapshot
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
inferredcites →https://doi.org/10.1137/0907058openalex-snapshot
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
inferredcites →https://doi.org/10.1137/090770114openalex-snapshot
Recursively Accelerated Multilevel Aggregation for Markov Chains
inferredcites →https://doi.org/10.1137/1.9781611970739openalex-snapshot
Numerical Methods for Large Eigenvalue Problems
inferredcites →https://doi.org/10.1137/s0895479895281484openalex-snapshot
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
inferredcites →https://doi.org/10.1145/775152.775190openalex-snapshot
Extrapolation methods for accelerating PageRank computations
inferredcites →https://doi.org/10.1287/opre.40.6.1156openalex-snapshot
Numerical Methods in Markov Chain Modeling
inferredcites →https://doi.org/10.21236/ada447560openalex-snapshot
Deflation Techniques for an Implicitly Re-started Arnoldi Iteration
inferredcites →https://doi.org/10.48550/arxiv.math/0401177openalex-snapshot
A Note on the Eigenvalues of the Google Matrix

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.2541openalex-snapshot
Preconditioned weighted full orthogonalization method for solving singular linear systems from PageRank problems
inferred← citeshttps://doi.org/10.1002/nla.826openalex-snapshot
Structured matrices and tensors
inferred← citeshttps://doi.org/10.1007/978-1-4614-6170-8_148openalex-snapshot
Iterative Methods for Eigenvalues/Eigenvectors
inferred← citeshttps://doi.org/10.1007/978-1-4614-7163-9_148-1openalex-snapshot
Iterative Methods for Eigenvalues/Eigenvectors
inferred← citeshttps://doi.org/10.1007/978-1-4939-7131-2_148openalex-snapshot
Iterative Methods for Eigenvalues/Eigenvectors
inferred← citeshttps://doi.org/10.1007/s10543-012-0398-9openalex-snapshot
Numerical stability of orthogonalization methods with a non-standard inner product
inferred← citeshttps://doi.org/10.1007/s11075-021-01175-wopenalex-snapshot
A Hessenberg-type algorithm for computing PageRank Problems
inferred← citeshttps://doi.org/10.1007/s11075-022-01337-4openalex-snapshot
An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
inferred← citeshttps://doi.org/10.1007/s11227-024-06327-yopenalex-snapshot
Application of an extrapolation method in the Hessenberg algorithm for computing PageRank
inferred← citeshttps://doi.org/10.1007/s11227-024-06669-7openalex-snapshot
A modified multi-step splitting iteration and its variants for computing PageRank
inferred← citeshttps://doi.org/10.1007/s12190-013-0645-5openalex-snapshot
On the multi-splitting iteration method for computing PageRank
inferred← citeshttps://doi.org/10.1007/s40314-016-0338-4openalex-snapshot
A relaxed two-step splitting iteration method for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126799openalex-snapshot
Shifted power-GMRES method accelerated by extrapolation for solving PageRank with multiple damping factors
inferred← citeshttps://doi.org/10.1016/j.cam.2014.02.018openalex-snapshot
Recent advances in bibliometric indexes and the PaperRank problem
inferred← citeshttps://doi.org/10.1016/j.cam.2015.09.027openalex-snapshot
FOM accelerated by an extrapolation method for solving PageRank problems
inferred← citeshttps://doi.org/10.1016/j.cam.2020.113034openalex-snapshot
A variant of the Power–Arnoldi algorithm for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.cam.2020.113209openalex-snapshot
An adaptive Power-GArnoldi algorithm for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.cam.2022.114395openalex-snapshot
A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.cam.2024.116332openalex-snapshot
Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
inferred← citeshttps://doi.org/10.15587/1729-4061.2018.131275openalex-snapshot
An algebraic method for calculating PageRank
inferred← citeshttps://doi.org/10.3390/sym13081327openalex-snapshot
A Preconditioned Variant of the Refined Arnoldi Method for Computing PageRank Eigenvectors
inferred← citeshttps://doi.org/10.3934/era.2022039openalex-snapshot
Acceleration of the generalized FOM algorithm for computing PageRank
inferred← citeshttps://doi.org/10.3934/math.2021053openalex-snapshot
Acceleration of an adaptive generalized Arnoldi method for computing PageRank
inferred← citeshttps://doi.org/10.3934/math.20231282openalex-snapshot
Recursive reordering and elimination method for efficient computation of PageRank problems
inferred← citeshttps://doi.org/10.3934/naco.2012.2.855openalex-snapshot
On convergence of the inner-outer iteration method for computing PageRank
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.