research
∙
02/13/2023
Fast evaluation and root finding for polynomials with floating-point coefficients
Evaluating or finding the roots of a polynomial f(z) = f_0 + ⋯ + f_d z^d...
share
research
∙
06/04/2021
New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems
We present a new data structure to approximate accurately and efficientl...
research
∙
02/08/2021
Fast real and complex root-finding methods for well-conditioned polynomials
Given a polynomial p of degree d and a bound κ on a condition number of ...
research
∙
11/02/2020
Optimal transport between determinantal point processes and application to fast simulation
We analyze several optimal transportation problems between de-terminanta...
research
∙
12/12/2019
Evaluation of Chebyshev polynomials on intervals and application to root finding
In approximation theory, it is standard to approximate functions by poly...
research
∙
12/19/2017
Computing effectively stabilizing controllers for a class of nD systems
In this paper, we study the internal stabilizability and internal stabil...
research
∙
09/14/2016
