An improved rational cubic clipping method for computing real roots of a polynomial

Shi Li, Guang Chen and Yigang Wang

Applied Mathematics and Computation, 2019, vol. 349, issue C, 207-213

Abstract: The root-finding problem has wide applications in geometric processing and computer graphics. Previous rational cubic clipping methods are either of convergence rate 7/k with O(n2) complexity, or of convergence rate 5/k with linear complexity, where n and k are degree of the given polynomial and the multiplicity of the root, respectively. This paper presents an improved rational cubic clipping of linear complexity, which can achieve convergence rate 7/k, or a better one 7/(k−1) for a multiple root such that k ≥ 2. Numerical examples illustrate both efficiency and convergence rate of the new method.

Keywords: Root-finding; Rational cubic clipping method; linear complexity; Convergence rate (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318311019
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:349:y:2019:i:c:p:207-213

DOI: 10.1016/j.amc.2018.12.040

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().