On the public citation graph

A Power–Arnoldi algorithm for computing PageRank

0 signed · 87 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.1007/s002110050015openalex-snapshot
Hybrid procedures for solving linear systems
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/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
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/j.laa.2005.07.024openalex-snapshot
A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
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/s0025-5718-96-00745-4openalex-snapshot
On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
inferredcites →https://doi.org/10.1109/tkde.2003.1208999openalex-snapshot
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
inferredcites →https://doi.org/10.1137/040607551openalex-snapshot
A Reordering for the PageRank Problem
inferredcites →https://doi.org/10.1137/0613025openalex-snapshot
Implicit Application of Polynomial Filters in a k -Step Arnoldi Method
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/1.9780898719512openalex-snapshot
Matrix Analysis and Applied Linear Algebra
inferredcites →https://doi.org/10.1137/1.9780898719581openalex-snapshot
Templates for the Solution of Algebraic Eigenvalue Problems
inferredcites →https://doi.org/10.1137/1.9781611972467openalex-snapshot
Eigenvalues of Matrices
inferredcites →https://doi.org/10.1137/s0036144503424786openalex-snapshot
A Survey of Eigenvector Methods for Web Information Retrieval
inferredcites →https://doi.org/10.1137/s0895479895281484openalex-snapshot
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
inferredcites →https://doi.org/10.1137/s0895479898334605openalex-snapshot
Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
inferredcites →https://doi.org/10.1137/s1064827599364659openalex-snapshot
GMRES with Deflated Restarting
inferredcites →https://doi.org/10.1145/1013367.1013491openalex-snapshot
Updating pagerank with iterative aggregation
inferredcites →https://doi.org/10.1145/1060745.1060827openalex-snapshot
PageRank as a function of the damping factor
inferredcites →https://doi.org/10.1145/1148170.1148187openalex-snapshot
AggregateRank
inferredcites →https://doi.org/10.1145/775152.775190openalex-snapshot
Extrapolation methods for accelerating PageRank computations
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem
inferredcites →https://doi.org/10.5860/choice.38-5065openalex-snapshot
Matrix analysis and applied linear algebra

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.2340openalex-snapshot
A method for computing the Perron root for primitive matrices
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.789openalex-snapshot
On adaptively accelerated Arnoldi method for computing PageRank
inferred← citeshttps://doi.org/10.1007/978-3-642-16515-3_47openalex-snapshot
On Arnoldi Method Accelerating PageRank Computations
inferred← citeshttps://doi.org/10.1007/s10092-016-0211-2openalex-snapshot
An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
inferred← citeshttps://doi.org/10.1007/s10092-023-00532-6openalex-snapshot
Deflated and restarted Krylov subspace methods for Sylvester tensor equations
inferred← citeshttps://doi.org/10.1007/s10791-012-9183-2openalex-snapshot
Lumping algorithms for computing Google’s PageRank and its derivative, with attention to unreferenced nodes
inferred← citeshttps://doi.org/10.1007/s10915-013-9696-xopenalex-snapshot
Accelerating the Arnoldi-Type Algorithm for the PageRank Problem and the ProteinRank Problem
inferred← citeshttps://doi.org/10.1007/s10915-024-02735-7openalex-snapshot
Two Accelerated Non-backtracking PageRank Algorithms for Large-scale Networks
inferred← citeshttps://doi.org/10.1007/s11075-018-0597-9openalex-snapshot
Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
inferred← citeshttps://doi.org/10.1007/s11075-021-01166-xopenalex-snapshot
The coupled iteration algorithms for computing PageRank
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/s11219-021-09579-6openalex-snapshot
Does PageRank apply to service ranking in microservice regression testing?
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.1007/s40314-019-0830-8openalex-snapshot
A general multi-splitting iteration method for computing PageRank
inferred← citeshttps://doi.org/10.1007/s41870-021-00854-0openalex-snapshot
A novel approximate PageRank computation: QEGauss-Seidel PageRank
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2018.03.002openalex-snapshot
Parallel two-stage algorithms for solving the PageRank problem
inferred← citeshttps://doi.org/10.1016/j.amc.2018.05.033openalex-snapshot
A preprocessed multi-step splitting iteration for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.amc.2019.02.066openalex-snapshot
The general inner-outer iteration method based on regular splittings for the PageRank problem
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.amc.2023.128276openalex-snapshot
A parallel PageRank algorithm for undirected graph
inferred← citeshttps://doi.org/10.1016/j.cam.2007.05.015openalex-snapshot
Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
inferred← citeshttps://doi.org/10.1016/j.cam.2008.06.003openalex-snapshot
On computing PageRank via lumping the Google matrix
inferred← citeshttps://doi.org/10.1016/j.cam.2010.02.009openalex-snapshot
An Arnoldi-Extrapolation algorithm for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.cam.2012.04.006openalex-snapshot
Practical acceleration for computing the HITS ExpertRank vectors
inferred← citeshttps://doi.org/10.1016/j.cam.2014.09.022openalex-snapshot
A two-step matrix splitting iteration for computing PageRank
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.2016.05.026openalex-snapshot
An Arnoldi-Inout algorithm for computing PageRank problems
inferred← citeshttps://doi.org/10.1016/j.cam.2016.08.034openalex-snapshot
A new extrapolation method for PageRank computations
inferred← citeshttps://doi.org/10.1016/j.cam.2016.10.020openalex-snapshot
A note on the two-step matrix splitting iteration for computing PageRank
inferred← citeshttps://doi.org/10.1016/j.cam.2018.03.017openalex-snapshot
A GMRES-Power algorithm for computing PageRank problems
inferred← citeshttps://doi.org/10.1016/j.cam.2020.112891openalex-snapshot
Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank
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.116189openalex-snapshot
Lightning graph matching
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.1016/j.camwa.2009.02.027openalex-snapshot
On the eigenvalues of a specially rank-r updated complex matrix
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.05.034openalex-snapshot
A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
inferred← citeshttps://doi.org/10.1016/j.patcog.2014.07.024openalex-snapshot
Inexact and incremental bilinear Lanczos components algorithms for high dimensionality reduction and image reconstruction
inferred← citeshttps://doi.org/10.1080/00207160.2010.489639openalex-snapshot
Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
inferred← citeshttps://doi.org/10.1089/cmb.2009.0004openalex-snapshot
Krylov Subspace Algorithms for Computing GeneRank for the Analysis of Microarray Data Mining
inferred← citeshttps://doi.org/10.1137/070682204openalex-snapshot
Comments on "Jordan Canonical Form of the Google Matrix"
inferred← citeshttps://doi.org/10.1145/1777432.1777434openalex-snapshot
Arnoldi versus GMRES for computing pageRank
inferred← citeshttps://doi.org/10.1155/2013/507915openalex-snapshot
An Adaptive Reordered Method for Computing PageRank
inferred← citeshttps://doi.org/10.1177/01655515231167388openalex-snapshot
Knowledge diffusion trajectories of PageRank: A main path analysis
inferred← citeshttps://doi.org/10.15587/1729-4061.2018.131275openalex-snapshot
An algebraic method for calculating PageRank
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2624542/v1openalex-snapshot
Two Parallel PageRank Algorithms via Improving Forward Push
inferred← citeshttps://doi.org/10.2298/fil1903725topenalex-snapshot
The modified matrix splitting iteration method for computing PageRank problem
inferred← citeshttps://doi.org/10.2298/fil2102679topenalex-snapshot
A general multi-step matrix splitting iteration method for computing PageRank
inferred← citeshttps://doi.org/10.3390/fractalfract9050313openalex-snapshot
A High-Order Fractional Parallel Scheme for Efficient Eigenvalue Computation
inferred← citeshttps://doi.org/10.3390/math11153320openalex-snapshot
A Parameterized Multi-Splitting Iterative Method for Solving the PageRank Problem
inferred← citeshttps://doi.org/10.3390/math7100911openalex-snapshot
Non-Stationary Acceleration Strategies for PageRank Computing
inferred← citeshttps://doi.org/10.3390/sym13040636openalex-snapshot
Anderson Acceleration of the Arnoldi-Inout Method for Computing 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
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.