Progressive explicit formulae for root-finding problems based on reparameterization

DOI10.1007/S11766-025-4808-6MaRDI QIDQ6852962zbMATH OpenFDO

Authors Hui Wang, Cheng Qian, Xiao-Diao Chen

Publication date 25 February 2026

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11766-025-4808-6

zbMATH Keywords

clipping methodconvergence ordernon-linear equation systemnumerical iterative methodprogressive explicit formulaere-parameterization-based methodroot-finding

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Approximation algorithms (68W25)

Cites work

• A family of modified Ostrowski's methods with optimal eighth order of convergence
• A fast and robust method for computing real roots of nonlinear equations
• A new family of optimal eighth order methods with dynamics for nonlinear equations
• A rational cubic clipping method for computing real roots of a polynomial
• An efficient family of weighted-Newton methods with optimal eighth order convergence
• An efficient method based on progressive interpolation for solving non-linear equations
• An efficient optimal family of sixteenth order methods for nonlinear models
• An eighth-order family of optimal multiple root finders and its dynamics
• An improved rational cubic clipping method for computing real roots of a polynomial
• An optimal and efficient general eighth-order derivative free scheme for simple roots
• An unconditionally convergent method for computing zeros of splines and polynomials
• COMPARATIVE STUDY OF METHODS OF VARIOUS ORDERS FOR FINDING SIMPLE ROOTS OF NONLINEAR EQUATIONS
• Computers in mathematical research: the study of three-point root-finding methods
• Computing roots of polynomials by quadratic clipping
• Curve intersection using Bézier clipping
• Eighth order family of iterative methods for nonlinear equations and their basins of attraction
• Fast approach for computing roots of polynomials using cubic clipping
• General approach to constructing optimal multipoint families of iterative methods using Hermite's rational interpolation
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3516003 (Why is no real title available?)
• Introduction to Interval Analysis
• On an Aitken-Steffensen-Newton type method
• On the optimal stability of the Bernstein basis
• Optimal Order of One-Point and Multipoint Iteration
• Rational cubic clipping with linear complexity for computing roots of polynomials
• Sixteenth-order method for nonlinear equations
• The dual basis functions for the Bernstein polynomials

This page was built for publication: Progressive explicit formulae for root-finding problems based on reparameterization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852962)