Explicit formulae for progressively computing a real root of the smooth function

DOI10.3785/J.ISSN.1008-9497.2021.02.002MaRDI QIDQ4996563zbMATHFDO

Authors Ping Zhu, Xiao-Diao Chen, Weiyin Ma, Nichang Jiang

Publication date 1 July 2021

zbMATH Keywords

reparameterizationroot-findingconvergence ordernumerical iterative methodclipping method

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• Efficient rational quadratic clipping method for computing roots of a polynomial
• A rational cubic clipping method for computing real roots of a polynomial
• Rational cubic clipping with linear complexity for computing roots of polynomials
• A fast and robust method for computing real roots of nonlinear equations
• An improved rational cubic clipping method for computing real roots of a polynomial

Cited in

(1)

• Forcing smooth square roots and integration

This page was built for publication: Explicit formulae for progressively computing a real root of the smooth function

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