On the public citation graph
Computational Complexity of Iterative Processes
0 signed · 52 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/bf01933248openalex-snapshot
Some efficient fourth order multipoint methods for solving equations
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0022-247x(71)90031-xopenalex-snapshot
On optimum root-finding algorithms
inferredcites →https://doi.org/10.1016/c2013-0-12430-0openalex-snapshot
Functional Analysis and Numerical Mathematics
inferredcites →https://doi.org/10.1109/swct.1964.6openalex-snapshot
Computational complexity of recursive sequnces
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.189openalex-snapshot
SOLUTION OF EQUATIONS AND SYSTEMS OF EQUATIONS (SECOND EDITION)
inferredcites →https://doi.org/10.1137/0120004openalex-snapshot
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
inferredcites →https://doi.org/10.1137/0709019openalex-snapshot
Optimality in a Class of Rootfinding Algorithms
inferredcites →https://doi.org/10.1137/0710072openalex-snapshot
A Family of Fourth Order Methods for Nonlinear Equations
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1145/321574.321575openalex-snapshot
Form and Content in Computer Science (1970 ACM turing lecture)
inferredcites →https://doi.org/10.1145/321765.321772openalex-snapshot
Toward Abstract Numerical Analysis
inferredcites →https://doi.org/10.1145/800029.808506openalex-snapshot
On functional iteration and the calculation of roots
inferredcites →https://doi.org/10.1145/800152.804902openalex-snapshot
A bound on the multiplication efficiency of iteration
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/2004786openalex-snapshot
Functional Analysis and Numerical Mathematics
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
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.
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-11194-0_57openalex-snapshot
ID-Based Anonymous Multi-receiver Key Encapsulation Mechanism with Sender Authentication
inferred← citeshttps://doi.org/10.1007/bf02253055openalex-snapshot
Square rooting is as difficult as multiplication
inferred← citeshttps://doi.org/10.1007/bfb0074154openalex-snapshot
On the solution of large, sparse sets of nonlinear equations
inferred← citeshttps://doi.org/10.1007/s12190-025-02582-1openalex-snapshot
Dynamical and convergence analysis of a new memory-based iterative method
inferred← citeshttps://doi.org/10.1016/0771-050x(75)90005-4openalex-snapshot
A survey of techniques in applied computational complexity
inferred← citeshttps://doi.org/10.1016/0898-1221(76)90012-2openalex-snapshot
Comparing parallel Newton's method with parallel Laguerre's method
inferred← citeshttps://doi.org/10.1016/b978-0-12-697560-4.50007-1openalex-snapshot
STRICT LOWER AND UPPER BOUNDS ON ITERATIVE COMPUTATIONAL COMPLEXITY
inferred← citeshttps://doi.org/10.1016/b978-0-444-52730-1.00003-5openalex-snapshot
Methods Involving Second or Higher Derivatives
inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80027-3openalex-snapshot
A bound on the multiplicative efficiency of iteration
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)11003-9openalex-snapshot
Linear Programming and Condition Numbers under the Real Number Computation Model
inferred← citeshttps://doi.org/10.1080/00207160903365875openalex-snapshot
Second-derivative free methods of third and fourth order for solving nonlinear equations
inferred← citeshttps://doi.org/10.1090/psapm/020/0353723openalex-snapshot
An introduction to some current research in numerical computational complexity
inferred← citeshttps://doi.org/10.1109/tpwrd.2023.3280551openalex-snapshot
Model-Less Non-Technical Loss Detection Using Smart Meter Data
inferred← citeshttps://doi.org/10.1126/science.243.4895.1142-aopenalex-snapshot
Information-Based Complexity
inferred← citeshttps://doi.org/10.1137/0711073openalex-snapshot
Maximal Stationary Iterative Methods for the Solution of Operator Equations
inferred← citeshttps://doi.org/10.1137/0712012openalex-snapshot
Generalized Information and Maximal Order of Iteration for Operator Equations
inferred← citeshttps://doi.org/10.1137/0713010openalex-snapshot
Optimal Order and Efficiency for Iterations with Two Evaluations
inferred← citeshttps://doi.org/10.1145/321850.321860openalex-snapshot
Optimal Order of One-Point and Multipoint Iteration
inferred← citeshttps://doi.org/10.1145/361454.361462openalex-snapshot
Numerical mathematics and computer science
inferred← citeshttps://doi.org/10.1145/382218.382477openalex-snapshot
A guide to the literature for undergraduate and graduate courses in numerical mathematics
inferred← citeshttps://doi.org/10.1145/800152.804902openalex-snapshot
A bound on the multiplication efficiency of iteration
inferred← citeshttps://doi.org/10.1184/r1/6479033openalex-snapshot
Optimal order and minimal complexity of one-step methods for initial value problems
inferred← citeshttps://doi.org/10.1184/r1/6604310openalex-snapshot
Computational complexity of one-point and multipoint iteration
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.32604/cmc.2023.033528openalex-snapshot
Efficient Numerical Scheme for Solving Large System of Nonlinear Equations
inferred← citeshttps://doi.org/10.3934/math.2024433openalex-snapshot
On the stability analysis of numerical schemes for solving non-linear polynomials arises in engineering problems
inferred← citeshttps://doi.org/10.48550/arxiv.1004.3608openalex-snapshot
The complexity of multiple-precision arithmetic
inferred← citeshttps://doi.org/10.5120/15686-4556openalex-snapshot
Removal of Impulse Noise using Iterative Unsymmetrical Trimmed Median Filter
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.