Rémi Imbach
16
Documents
Publications
|
Clustering Complex Zeros of Triangular Systems of PolynomialsMathematics in Computer Science, 2020, ⟨10.1007/s11786-020-00482-0⟩
Article dans une revue
hal-02878388v1
|
|
Reliable Location with Respect to the Projection of a Smooth Space CurveReliable Computing, 2018, 26, pp.13-55
Article dans une revue
hal-01920444v1
|
A robust and efficient method for solving point distance problems by homotopyMathematical Programming, 2017, 163 (1-2), pp.115-144. ⟨10.1007/s10107-016-1058-7⟩
Article dans une revue
hal-02077912v1
|
|
|
A certified numerical algorithm for the topology of resultant and discriminant curvesJournal of Symbolic Computation, 2016, 80, Part 2, pp.285--306. ⟨10.1016/j.jsc.2016.03.011⟩
Article dans une revue
hal-01402194v1
|
Leading a continuation method by geometry for solving geometric constraintsComputer-Aided Design, 2014, 46, pp.138-147. ⟨10.1016/j.cad.2013.08.026⟩
Article dans une revue
hal-02077917v1
|
|
Fast evaluation and root finding for polynomials with floating-point coefficientsISSAC 2023, Jul 2023, Tromsø, Norway
Communication dans un congrès
hal-03980098v1
|
|
Clustering Complex Zeros of Triangular System of PolynomialsCASC 2019 - 21st International Workshop on Computer Algebra in Scientific Computing, Aug 2019, Moscow, Russia
Communication dans un congrès
hal-01825708v3
|
|
Numeric and Certified Isolation of the Singularities of the Projection of a Smooth Space CurveProceedings of the 6th International Conferences on Mathematical Aspects of Computer and Information Sciences, Oct 2015, Berlin, Germany
Communication dans un congrès
hal-01239447v1
|
Decomposition of geometrical constraint systems with reparameterizationSAC '12 - Proceedings of the 27th Annual ACM Symposium on Applied Computing, Mar 2012, Trento, France. pp.102-108, ⟨10.1145/2245276.2245298⟩
Communication dans un congrès
hal-02077922v1
|
|
Tracking Method for Reparametrized Geometrical Constraint SystemsSYNASC 2011 - 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2011, Timisoara, Romania. pp.31-38, ⟨10.1109/SYNASC.2011.26⟩
Communication dans un congrès
hal-02077924v1
|
Implementation of a Near-Optimal Complex Root Clustering AlgorithmMathematical Software -- ICMS 2018, pp.235-244, 2018, ⟨10.1007/978-3-319-96418-8_28⟩
Chapitre d'ouvrage
hal-02077920v1
|
|
Implementation of a Near-Optimal Complex Root Clustering Algorithm[Research Report] TU Kaiserslautern; City University of New York; Courant Institute of Mathematical Sciences, New York University. 2018
Rapport
hal-01822137v1
|
|
Reliable location with respect to the projection of a smooth space curve[Research Report] INRIA. 2017
Rapport
hal-01632344v1
|
|
A Subdivision Solver for Systems of Large Dense Polynomials[Technical Report] RT-0476, INRIA Nancy. 2016, pp.13
Rapport
hal-01293526v2
|
|
A Robust and Efficient Method for Solving Point Distance Problems by Homotopy[Research Report] RR-8705, INRIA. 2016
Rapport
hal-01135230v3
|
|
Numeric certified algorithm for the topology of resultant and discriminant curves[Research Report] RR-8653, Inria. 2015
Rapport
hal-01093040v3
|