On the public citation graph

Initial approximations in Durand-Kerner's root finding method

0 signed · 23 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/bf01934913openalex-snapshot
Two observations on Durand-Kerner's root-finding method
inferredcites →https://doi.org/10.1137/0707045openalex-snapshot
A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
inferredcites →https://doi.org/10.1145/363067.363115openalex-snapshot
A modified Newton method for polynomials

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-53065-7_162openalex-snapshot
A performance analysis of network topologies in finding the roots of a polynomial
inferred← citeshttps://doi.org/10.1007/bf01952788openalex-snapshot
The Durand-Kerner polynomials roots-finding method in case of multiple roots
inferred← citeshttps://doi.org/10.1007/bf02207694openalex-snapshot
Numerical computation of polynomial zeros by means of Aberth's method
inferred← citeshttps://doi.org/10.1007/bf02684414openalex-snapshot
Polynomial root finding by means of continuation
inferred← citeshttps://doi.org/10.1007/s10586-007-0013-zopenalex-snapshot
The performance of synchronous parallel polynomial root extraction on a ring multicomputer
inferred← citeshttps://doi.org/10.1007/s11075-006-9048-0openalex-snapshot
Computing curve intersection by means of simultaneous iterations
inferred← citeshttps://doi.org/10.1007/s11227-009-0312-7openalex-snapshot
Parallel algorithms for finding polynomial Roots on OTIS-torus
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90032-5openalex-snapshot
Finding the roots of a polynomial on an MIMD multicomputer
inferred← citeshttps://doi.org/10.1016/j.laa.2013.02.024openalex-snapshot
Solving polynomial eigenvalue problems by means of the Ehrlich–Aberth method
inferred← citeshttps://doi.org/10.1016/s1570-8659(05)80019-5openalex-snapshot
Numerical solution of polynomial equations
inferred← citeshttps://doi.org/10.1023/a:1019199917103openalex-snapshot
Design, analysis, and implementation of a multiprecision polynomial rootfinder
inferred← citeshttps://doi.org/10.1080/00207169208804138openalex-snapshot
On simultaneous factoring of a polynomial
inferred← citeshttps://doi.org/10.1093/mnras/stac1565openalex-snapshot
Improved Aberth–Ehrlich root-finding algorithm and its further application for binary microlensing
inferred← citeshttps://doi.org/10.1109/71.285609openalex-snapshot
Analysis of asynchronous polynomial root finding methods on a distributed memory multicomputer
inferred← citeshttps://doi.org/10.1109/cse-euc-dcabes.2016.196openalex-snapshot
Two Parallel Implementations of Ehrlich-Aberth Algorithm for Root-Finding of Polynomials on Multiple GPUs with OpenMP and MPI
inferred← citeshttps://doi.org/10.1137/120886741openalex-snapshot
Locating the Eigenvalues of Matrix Polynomials
inferred← citeshttps://doi.org/10.1137/s0895479803429788openalex-snapshot
The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
inferred← citeshttps://doi.org/10.1145/140901.140920openalex-snapshot
Polynomial root-finding
inferred← citeshttps://doi.org/10.3390/math9040317openalex-snapshot
A Neural Network-Based Approach for Approximating Arbitrary Roots of Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3632openalex-snapshot
Locating the eigenvalues of matrix polynomials
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.