On the public citation graph
A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
0 signed · 44 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.1002/zamm.19540340110openalex-snapshot
Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens
inferredcites →https://doi.org/10.1007/bf01385904openalex-snapshot
A posteriori error bounds for the zeros of polynomials
inferredcites →https://doi.org/10.1007/bf01386381openalex-snapshot
The evaluation of the zeros of ill-conditioned polynomials. Part I
inferredcites →https://doi.org/10.1007/bf01404681openalex-snapshot
Circular arithmetic and the determination of polynomial zeros
inferredcites →https://doi.org/10.1007/bf02162564openalex-snapshot
Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
inferredcites →https://doi.org/10.1016/0041-5553(64)90148-xopenalex-snapshot
Certain modifications of Newton's method for the approximate solution of algebraic equations
inferredcites →https://doi.org/10.1090/s0025-5718-1969-0266425-3openalex-snapshot
On Lehmer's Method for Finding the Zeros of a Polynomial
inferredcites →https://doi.org/10.1137/0711023openalex-snapshot
On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
inferredcites →https://doi.org/10.1145/321062.321064openalex-snapshot
A Machine Method for Solving Polynomial Equations
inferredcites →https://doi.org/10.1145/363067.363115openalex-snapshot
A modified Newton method for polynomials
inferredcites →https://doi.org/10.1215/s0012-7094-46-01312-9openalex-snapshot
Roots of equations by functional iteration
inferredcites →https://doi.org/10.2307/2003646openalex-snapshot
Solutions Numeriques des Equations Algebriques
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/bf01930986openalex-snapshot
A method for computing all the zeros of a polynomial with real coefficients
inferred← citeshttps://doi.org/10.1007/bf01932157openalex-snapshot
Comments on a root finding method using Padé approximation
inferred← citeshttps://doi.org/10.1007/bf01934913openalex-snapshot
Two observations on Durand-Kerner's root-finding method
inferred← citeshttps://doi.org/10.1007/bf02280787openalex-snapshot
On the convergence order of a modified method for simultaneous finding polynomial zeros
inferred← citeshttps://doi.org/10.1007/bf03167312openalex-snapshot
On nonlinear SOR-like methods, I — Applications to simultaneous methods for polynomial zeros
inferred← citeshttps://doi.org/10.1007/s11075-026-02503-8openalex-snapshot
Schröder-like families as subfamilies of Simeunović’s general scheme: Commentary and historical notes
inferred← citeshttps://doi.org/10.1016/0096-3003(88)90136-1openalex-snapshot
Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90093-8openalex-snapshot
Calculating polynomial zeros on a local memory parallel computer
inferred← citeshttps://doi.org/10.1016/0377-0427(85)90037-8openalex-snapshot
An algorithm for the computation of zeros of a special class of entire functions
inferred← citeshttps://doi.org/10.1016/0377-0427(91)90180-ropenalex-snapshot
Approximate GCD and its application to ill-conditioned equations
inferred← citeshttps://doi.org/10.1016/0377-0427(91)90184-lopenalex-snapshot
A high-order iterative formula for simultaneous determination of zeros of a polynomial
inferred← citeshttps://doi.org/10.1016/0898-1221(85)90042-2openalex-snapshot
Locating multiple zeros interactively
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/j.cam.2009.09.012openalex-snapshot
On Schröder’s families of root-finding methods
inferred← citeshttps://doi.org/10.1016/j.cam.2016.08.021openalex-snapshot
Iteration Functions re-visited
inferred← citeshttps://doi.org/10.1016/j.cam.2017.11.040openalex-snapshot
On the rediscovery of Halley’s iterative method for computing the zero of an analytic function
inferred← citeshttps://doi.org/10.1016/j.cam.2019.112513openalex-snapshot
Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80057-2openalex-snapshot
Asynchronous polynomial zero-finding algorithms
inferred← citeshttps://doi.org/10.1016/s0377-0427(99)00105-3openalex-snapshot
On rediscovered iteration methods for solving equations
inferred← citeshttps://doi.org/10.1016/s1570-8659(05)80019-5openalex-snapshot
Numerical solution of polynomial equations
inferred← citeshttps://doi.org/10.1017/s0305004100054098openalex-snapshot
An algorithm for the total, or partial, factorization of a polynomial
inferred← citeshttps://doi.org/10.1080/00207160.2011.641538openalex-snapshot
The improved Farmer–Loizou method for finding polynomial zeros
inferred← citeshttps://doi.org/10.1080/00207160802123425openalex-snapshot
An iteration method with maximal order based on standard information
inferred← citeshttps://doi.org/10.1080/00207168208803316openalex-snapshot
A family of simultaneous methods for the determination of polynomial complex zeros
inferred← citeshttps://doi.org/10.1080/00207168308803375openalex-snapshot
Higher-order iteration functions for simultaneously approximating polynomial zeros
inferred← citeshttps://doi.org/10.1109/icrem.2015.7357015openalex-snapshot
On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously
inferred← citeshttps://doi.org/10.1155/2012/709832openalex-snapshot
The Point Zoro Symmetric Single‐Step Procedure for Simultaneous Estimation of Polynomial Zeros
inferred← citeshttps://doi.org/10.13189/ms.2019.070406openalex-snapshot
Ehrlich-type Methods with King's Correction for the Simultaneous Approximation of Polynomial Complex Zeros
inferred← citeshttps://doi.org/10.14295/vetor.v33i2.16434openalex-snapshot
A New Ehrlich-Type Sixth-Order Simultaneous Method for Polynomial Complex Zeros
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.