Efficient rational quadratic clipping method for computing roots of a polynomial

DOI10.4310/CIS.2017.V17.N2.A3MaRDI QIDQ1659050zbMATH OpenFDO

Authors Xiao-Diao Chen, Yigang Wang, Weiyin Ma, Long-quan Wang, Li-Geng Chen

Publication date 15 August 2018

Published in Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/CIS.2017.V17.N2.A3

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• A rational cubic clipping method for computing real roots of a polynomial
• Rational cubic clipping with linear complexity for computing roots of polynomials
• An improved rational cubic clipping method for computing real roots of a polynomial
• Computing roots of polynomials by quadratic clipping
• Fast approach for computing roots of polynomials using cubic clipping

Cited in

(9)

• A rational cubic clipping method for computing real roots of a polynomial
• An improved rational cubic clipping method for computing real roots of a polynomial
• Polynomials root-finding using a SLEFE-based clipping method
• Explicit formulae for progressively computing a real root of the smooth function
• An efficient algorithm for computing the roots of general quadratic, cubic and quartic equations
• Fast approach for computing roots of polynomials using cubic clipping
• Rational cubic clipping with linear complexity for computing roots of polynomials
• A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
• Computing roots of polynomials by quadratic clipping

This page was built for publication: Efficient rational quadratic clipping method for computing roots of a polynomial

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