On the public citation graph
Some efficient methods for enclosing simple zeros of nonlinear equations
0 signed · 43 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.19880680802openalex-snapshot
On Two Higher Order Enclosing Methods of J. W. Schmidt
inferredcites →https://doi.org/10.1007/bf00939805openalex-snapshot
OnQ-order andR-order of convergence
inferredcites →https://doi.org/10.1007/bf02234103openalex-snapshot
Eingrenzung von Lösungen nichtlinearer Gleichungen durch Verfahren mit höherer Konvergenzgeschwindigkeit
inferredcites →https://doi.org/10.1007/bf02237952openalex-snapshot
On the R-order of coupled sequences
inferredcites →https://doi.org/10.1007/bf02243144openalex-snapshot
A new class of interval methods with higher order of convergence
inferredcites →https://doi.org/10.1007/bf02252259openalex-snapshot
Methods without secant steps for finding a bracketed root
inferredcites →https://doi.org/10.1016/c2009-0-21898-8openalex-snapshot
Introduction to Interval Computation
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0371062-9openalex-snapshot
Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973)
inferredcites →https://doi.org/10.2307/2005713openalex-snapshot
Algorithms for Minimization Without Derivatives
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02389896openalex-snapshot
Improving the efficiency index in enclosing a root of an equation
inferred← citeshttps://doi.org/10.1007/s10092-006-0113-9openalex-snapshot
A modification of Muller’s method
inferred← citeshttps://doi.org/10.1007/s100920050020openalex-snapshot
An iterative method for the computation of the solutions of nonlinear equations
inferred← citeshttps://doi.org/10.1007/s100920300006openalex-snapshot
Hermite interpolation and a new iterative method¶for the computation of the roots¶of non-linear equations
inferred← citeshttps://doi.org/10.1007/s11075-006-9015-9openalex-snapshot
An exponential regula falsi method for solving nonlinear equations
inferred← citeshttps://doi.org/10.1007/s11075-014-9905-1openalex-snapshot
Always convergent iteration methods for nonlinear equations of Lipschitz functions
inferred← citeshttps://doi.org/10.1007/s40065-021-00323-3openalex-snapshot
A derivative free globally convergent method and its deformations
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00073-9openalex-snapshot
The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00123-xopenalex-snapshot
New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems
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.amc.2004.04.120openalex-snapshot
Improved Muller method and Bisection method with global and asymptotic superlinear convergence of both point and interval for solving nonlinear equations
inferred← citeshttps://doi.org/10.1016/j.amc.2005.04.043openalex-snapshot
An improvement to Ostrowski root-finding method
inferred← citeshttps://doi.org/10.1016/j.amc.2006.02.036openalex-snapshot
Some substantial modifications and improvements for derivative-free iterative methods and derivative-free transformation for multiple zeros
inferred← citeshttps://doi.org/10.1016/j.amc.2007.01.009openalex-snapshot
A family of modified Ostrowski methods with accelerated sixth order convergence
inferred← citeshttps://doi.org/10.1016/j.amc.2009.01.021openalex-snapshot
Adams-like techniques for zero-finder methods
inferred← citeshttps://doi.org/10.1016/j.amc.2012.12.064openalex-snapshot
Superlinear bracketing method for solving nonlinear equations
inferred← citeshttps://doi.org/10.1016/j.aml.2012.02.006openalex-snapshot
Combined bracketing methods for solving nonlinear equations
inferred← citeshttps://doi.org/10.1016/j.apnum.2006.01.001openalex-snapshot
An improved exponential regula falsi methods with quadratic convergence of both diameter and point for solving nonlinear equations
inferred← citeshttps://doi.org/10.1016/j.cam.2006.10.059openalex-snapshot
Polynomial approximation of CM functions by means of boundary values and applications: A survey
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.09.086openalex-snapshot
An improvement of the Euler–Chebyshev iterative method
inferred← citeshttps://doi.org/10.1016/j.matcom.2022.10.019openalex-snapshot
A common framework for modified Regula Falsi methods and new methods of this kind
inferred← citeshttps://doi.org/10.1016/j.matcom.2023.08.003openalex-snapshot
A superlinear Scaling Factor Regula Falsi root finder that detects the simple or multiple character of the root
inferred← citeshttps://doi.org/10.1016/j.mcm.2006.07.003openalex-snapshot
A new family of exponential iteration methods with quadratic convergence of both diameters and points for enclosing zeros of nonlinear equations
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00414-9openalex-snapshot
An improved regula falsi method with quadratic convergence of both diameter and point for enclosing simple zeros of nonlinear equations
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00290-xopenalex-snapshot
New high-order convergence iteration methods without employing derivatives for solving nonlinear equations
inferred← citeshttps://doi.org/10.1023/a:1014078328575openalex-snapshot
A New Iterative Method for the Computation of the Solutions of Nonlinear Equations
inferred← citeshttps://doi.org/10.1023/a:1022330705119openalex-snapshot
A QR Decomposition for Matrix Pencils
inferred← citeshttps://doi.org/10.1023/a:1026100500306openalex-snapshot
An Improvement to the Computing of Nonlinear Equation Solutions
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1192965-2openalex-snapshot
On Enclosing Simple Roots of Nonlinear Equations
inferred← citeshttps://doi.org/10.1109/icsmc.2012.6377763openalex-snapshot
Interval methods for root-finding of nonlinear equations of one variable
inferred← citeshttps://doi.org/10.1112/s1461157015000236openalex-snapshot
A parallel root-finding algorithm
inferred← citeshttps://doi.org/10.1145/210089.210111openalex-snapshot
Algorithm 748: enclosing zeros of continuous functions
inferred← citeshttps://doi.org/10.1155/2014/321592openalex-snapshot
A Method to Accelerate the Convergence of the Secant Algorithm
inferred← citeshttps://doi.org/10.3390/math11214551openalex-snapshot
Enhancing Equation Solving: Extending the Applicability of Steffensen-Type Methods
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.