On the public citation graph
An Inner-Outer Iteration for Computing PageRank
0 signed · 115 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/978-1-4612-4288-8openalex-snapshot
Iterative Solution of Large Sparse Systems of Equations
inferredcites →https://doi.org/10.1007/978-3-540-71681-5_2openalex-snapshot
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
inferredcites →https://doi.org/10.1007/978-3-540-77004-6_2openalex-snapshot
Distribution of PageRank Mass Among Principle Components of the Web
inferredcites →https://doi.org/10.1007/978-3-540-78808-9_10openalex-snapshot
Traps and Pitfalls of Topic-Biased PageRank
inferredcites →https://doi.org/10.1007/bf01397553openalex-snapshot
The convergence of inexact Chebyshev and Richardson iterative methods 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/b978-012088469-8.50052-8openalex-snapshot
Combating Web Spam with TrustRank
inferredcites →https://doi.org/10.1016/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1016/j.cam.2006.10.080openalex-snapshot
Comparison of Krylov subspace methods on the PageRank problem
inferredcites →https://doi.org/10.1016/j.crma.2005.01.015openalex-snapshot
Extrapolation methods for PageRank computations
inferredcites →https://doi.org/10.1080/15427951.2005.10129098openalex-snapshot
A Survey on PageRank Computing
inferredcites →https://doi.org/10.1137/050623280openalex-snapshot
The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
inferredcites →https://doi.org/10.1137/060664331openalex-snapshot
PageRank Computation, with Special Attention to Dangling Nodes
inferredcites →https://doi.org/10.1137/070698129openalex-snapshot
Ordinal Ranking for Google's PageRank
inferredcites →https://doi.org/10.1137/0731085openalex-snapshot
Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
inferredcites →https://doi.org/10.1137/s0036142995293742openalex-snapshot
Inner and Outer Iterations for the Chebyshev Algorithm
inferredcites →https://doi.org/10.1137/s0036144503424786openalex-snapshot
A Survey of Eigenvector Methods for Web Information Retrieval
inferredcites →https://doi.org/10.1137/s0895479804441407openalex-snapshot
Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
inferredcites →https://doi.org/10.1137/s1064827502406415openalex-snapshot
Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
inferredcites →https://doi.org/10.1145/1060745.1060827openalex-snapshot
PageRank as a function of the damping factor
inferredcites →https://doi.org/10.1145/1060745.1060829openalex-snapshot
A uniform approach to accelerated PageRank computation
inferredcites →https://doi.org/10.1145/1102351.1102482openalex-snapshot
Learning from labeled and unlabeled data on a directed graph
inferredcites →https://doi.org/10.1145/1498759.1498836openalex-snapshot
Speeding up algorithms on compressed web graphs
inferredcites →https://doi.org/10.1145/775152.775190openalex-snapshot
Extrapolation methods for accelerating PageRank computations
inferredcites →https://doi.org/10.1186/1471-2105-6-233openalex-snapshot
GeneRank: Using search engine technology for the analysis of microarray experiments
inferredcites →https://doi.org/10.1215/s0012-7094-52-01910-8openalex-snapshot
Limits for the characteristic roots of a matrix. IV: Applications to stochastic matrices
inferredcites →https://doi.org/10.1515/9780691223384openalex-snapshot
Introduction to the Numerical Solution of Markov Chains
inferredcites →https://doi.org/10.48550/arxiv.cs/0606047openalex-snapshot
Asynchronous iterative computations with Web information retrieval structures: The PageRank case
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119821588.ch3openalex-snapshot
PageRank and Perturbed Markov Chains
inferred← citeshttps://doi.org/10.1002/nla.2280openalex-snapshot
Extrapolation methods for fixed‐point multilinear PageRank computations
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.1007/978-3-030-02825-1_16openalex-snapshot
PageRank in Evolving Tree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-43736-7_11openalex-snapshot
A Simple Study of Pleasing Parallelism on Multicore Computers
inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_9openalex-snapshot
Iterative Schemes for Large Linear Systems
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/s10115-013-0691-1openalex-snapshot
Fast PageRank approximation by adaptive sampling
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/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/s11227-014-1118-9openalex-snapshot
Parallel relaxed and extrapolated algorithms 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/s11425-016-0274-0openalex-snapshot
Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
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/s41980-021-00656-xopenalex-snapshot
An Extrapolation Iteration and Its Lumped Type Iteration for Computing PageRank
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2016.01.024openalex-snapshot
A heuristic relaxed extrapolated algorithm for accelerating 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.2015.09.016openalex-snapshot
Parallel multisplitting iteration methods based on M-splitting for 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.2018.12.021openalex-snapshot
A shift and invert reorthogonalization Arnoldi algorithm for solving the chemical master equation
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.2025.129777openalex-snapshot
A two-stage parallel iteration method for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.aml.2014.05.017openalex-snapshot
A preconditioned and extrapolation-accelerated GMRES method for 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.2018.07.015openalex-snapshot
Off-diagonal low-rank preconditioner for difficult 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.2020.113295openalex-snapshot
Several relaxed iteration methods 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.116192openalex-snapshot
The MFPIO iteration and the FPMPE method for multilinear PageRank computations
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.cam.2025.116489openalex-snapshot
A modulus-based inner–outer iteration method for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2025.116746openalex-snapshot
Stable iterative refinement for solving linear systems with inaccurate computation
inferred← citeshttps://doi.org/10.1016/j.camwa.2018.01.003openalex-snapshot
An iteration method for solving the linear system Ax=b
inferred← citeshttps://doi.org/10.1016/j.camwa.2018.01.006openalex-snapshot
Two-stage iterations based on composite splittings for rectangular linear systems
inferred← citeshttps://doi.org/10.1016/j.cnsns.2017.11.031openalex-snapshot
Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems
inferred← citeshttps://doi.org/10.1016/j.compbiomed.2024.109240openalex-snapshot
Exploring potential ADHD biomarkers through advanced machine learning: An examination of audiovisual integration networks
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2018.09.027openalex-snapshot
New explicit iteration algorithms for solving coupled continuous Markovian jump Lyapunov matrix equations
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2020.02.026openalex-snapshot
A multi-step Smith-inner-outer iteration algorithm for solving coupled continuous Markovian jump Lyapunov matrix equations
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.06.010openalex-snapshot
Two-hop walks indicate PageRank order
inferred← citeshttps://doi.org/10.1080/15427951.2013.850455openalex-snapshot
Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
inferred← citeshttps://doi.org/10.1093/cercor/bhr269openalex-snapshot
Network Centrality in the Human Functional Connectome
inferred← citeshttps://doi.org/10.1101/2022.07.29.502000openalex-snapshot
Boolean dynamic modeling of TNFR1 signaling predicts a nested feedback loop regulating the apoptotic response at single-cell level
inferred← citeshttps://doi.org/10.1101/2023.09.26.559610openalex-snapshot
Differential Patterns of Associations within Audiovisual Integration Networks in Children with ADHD
inferred← citeshttps://doi.org/10.1103/physreve.87.022801openalex-snapshot
Uncovering disassortativity in large scale-free networks
inferred← citeshttps://doi.org/10.1109/access.2018.2851604openalex-snapshot
Fast PageRank Computation Based on Network Decomposition and DAG Structure
inferred← citeshttps://doi.org/10.1109/iatmsi56455.2022.10119387openalex-snapshot
Two Stage Chebyshev Semi-Iterative Method for PageRank Problem
inferred← citeshttps://doi.org/10.1137/1.9781611975321.39openalex-snapshot
Fast Flow-based Random Walk with Restart in a Multi-query Setting
inferred← citeshttps://doi.org/10.1137/110834585openalex-snapshot
A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
inferred← citeshttps://doi.org/10.1155/2013/438987openalex-snapshot
An Improved Approach to the PageRank Problems
inferred← citeshttps://doi.org/10.1155/2014/418605openalex-snapshot
A Model Based on Cocitation for Web Information Retrieval
inferred← citeshttps://doi.org/10.1515/math-2020-0120openalex-snapshot
A multi-power and multi-splitting inner-outer iteration for PageRank 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.3906/elk-1401-202openalex-snapshot
A new algorithm for detection of link spam contributed by zero-out link pages
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
inferred← citeshttps://doi.org/10.4018/978-1-5225-0105-3.ch018openalex-snapshot
Review of Link Structure Based Ranking Algorithms and Hanging Pages
inferred← citeshttps://doi.org/10.48550/arxiv.1707.00906openalex-snapshot
Prediction of Domain Values: High throughput screening of domain names using Support Vector Machines
inferred← citeshttps://doi.org/10.48550/arxiv.1810.11152openalex-snapshot
Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information
inferred← citeshttps://doi.org/10.48550/arxiv.2107.11080openalex-snapshot
Comments on lumping the Google 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.