On the public citation graph
Optimality in a Class of Rootfinding Algorithms
0 signed · 15 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.1016/0041-5553(65)90059-5openalex-snapshot
Matrix iterative analysis
inferredcites →https://doi.org/10.1145/800195.805927openalex-snapshot
A study of Ostrowski efficiency for composite iteration algorithms
inferredcites →https://doi.org/10.2172/6226683openalex-snapshot
Bounds on order and Ostrowski efficiency for interpolatory iteration algorithms
inferredcites →https://doi.org/10.2307/2005025openalex-snapshot
Solution of Equations and Systems of Equations
inferredcites →https://doi.org/10.2307/2316079openalex-snapshot
Iterative Methods for the Solution of Equations.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02293107openalex-snapshot
Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen
inferred← citeshttps://doi.org/10.1016/b978-0-444-52730-1.00001-1openalex-snapshot
Bisection and Interpolation Methods
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.11.015openalex-snapshot
Efficient polynomial root-refiners: A survey and new record efficiency estimates
inferred← citeshttps://doi.org/10.1080/00207168108803269openalex-snapshot
A note on neta's family of sixth-order methods for solving equations
inferred← citeshttps://doi.org/10.1090/s0025-5718-1977-0426464-0openalex-snapshot
Asymptotic behavior of vector recurrences with applications
inferred← citeshttps://doi.org/10.1137/0201012openalex-snapshot
Computational Complexity of Iterative Processes
inferred← citeshttps://doi.org/10.1137/0713010openalex-snapshot
Optimal Order and Efficiency for Iterations with Two Evaluations
inferred← citeshttps://doi.org/10.1184/r1/6608219openalex-snapshot
Order of vector recurrences with applications to nonlinear iteration, parallel algorithms, and the power method
inferred← citeshttps://doi.org/10.2307/2005788openalex-snapshot
Asymptotic Behavior of Vector Recurrences with Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1004.3608openalex-snapshot
The complexity of multiple-precision arithmetic
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.