5 citations · 6 across the 7 of their papers we have counts for
10 papers
Data-efficient extraction of optical properties from 3D Monte Carlo TPSFs using Bi-LSTM transfer learning
Joubine Aghili, Rémi Imbach, Anne Pallarès +2
Time-Resolved Spectroscopy (TRS) is a powerful modality for non-invasive characterization of turbid media. However, extracting optical properties, absorption and reduced scat…
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…
Accelerated Subdivision for Clustering Roots of Polynomials given by Evaluation Oracles
Rémi Imbach, Victor Y. Pan
In our quest for the design, the analysis and the implementation of a subdivision algorithm for finding the complex roots of univariate polynomials given by oracles for their evalu…
Root Radii and Subdivision for Polynomial Root-Finding
Rémi Imbach, Victor Y. Pan
We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{ö}nhage's efficient algorithm of 1982 for a single root radius. We revisi…
New practical advances in polynomial root clustering
Rémi Imbach, Victor Y. Pan
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial of degree with real or complex coefficients. As in their previous best subdi…
Polynomial root clustering and explicit deflation
Rémi Imbach, Victor Y. Pan
We seek complex roots of a univariate polynomial with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly op…
Implementation of a Near-Optimal Complex Root Clustering Algorithm
Rémi Imbach, Victor Y. Pan, Chee Yap
We describe Ccluster, a software for computing natural -clusters of complex roots in a given box of the complex plane. This algorithm from Becker et al.~(2016) is near-optimal w…
Clustering Complex Zeros of Triangular Systems of Polynomials
Rémi Imbach, Marc Pouget, Chee Yap
This paper gives the first algorithm for finding a set of natural -clusters of complex zeros of a triangular system of polynomials within a given polybox in , for…
A Subdivision Solver for Systems of Large Dense Polynomials
Rémi Imbach
We describe here the package {\tt subdivision\\_solver} for the mathematical software {\tt SageMath}. It provides a solver on real numbers for square systems of large dense polynom…
A Robust and Efficient Method for Solving Point Distance Problems by Homotopy
Rémi Imbach, Pascal Mathis, Pascal Schreck
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a nume…