39 citations · 92 across the 20 of their papers we have counts for
22 papers
Fast evaluation and root finding for polynomials with floating-point coefficients
Rémi Imbach, Guillaume Moroz
Evaluating or finding the roots of a polynomial with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation…
New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems
Guillaume Moroz
We present a new data structure to approximate accurately and efficiently a polynomial of degree given as a list of coefficients. Its properties allow us to improve the sta…
Fast real and complex root-finding methods for well-conditioned polynomials
Guillaume Moroz
Given a polynomial of degree and a bound on a condition number of , we present the first root-finding algorithms that return all its real and complex roots with a nu…
Optimal transport between determinantal point processes and application to fast simulation
Laurent Decreusefond, Guillaume Moroz
We analyze several optimal transportation problems between de-terminantal point processes. We show how to estimate some of the distances between distributions of DPP they induce. W…
Evaluation of Chebyshev polynomials on intervals and application to root finding
Viviane Ledoux, Guillaume Moroz
In approximation theory, it is standard to approximate functions by polynomials expressed in the Chebyshev basis. Evaluating a polynomial of degree n given in the Chebyshev bas…
Computing effectively stabilizing controllers for a class of D systems
Yacine Bouzidi, Thomas Cluzeau, Guillaume Moroz +1
In this paper, we study the internal stabilizability and internal stabilization problems for multidimensional (nD) systems. Within the fractional representation approach, a multidi…