Higher-order root distillers

Publication date 10 March 2015

Abstract: Recursive maps of high order of convergence

m

(say

m = 2^{10}

or

m = 2^{20}

) induce certain monotone step functions from which one can filter relevant information needed to globally separate and compute the real roots of a function on a given interval

[a, b]

. The process is here called a root distiller. A suitable root distiller has a powerful preconditioning effect enabling the computation, on the whole interval, of accurate roots of an high degree polynomial. Taking as model high-degree inexact Chebyshev polynomials and using the {sl Mathematica} system, worked numerical examples are given detailing our distiller algorithm.

This page was built for publication: Higher-order root distillers

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