| Publication | Date of Publication | Type |
|---|
| High Order Numerical Methods To Approximate The Singular Value Decomposition | 2023-09-12 | Paper |
Newton-type methods for simultaneous matrix diagonalization
Calcolo | 2022-10-06 | Paper |
Numerical approximation of multiple isolated roots of analytical systems
Annales Henri Lebesgue | 2020-11-11 | Paper |
| Numerical approximation of multiple isolated roots of analytic systems | 2017-07-19 | Paper |
Computing nearest gcd with certification
Proceedings of the 2009 conference on Symbolic numeric computation | 2017-02-03 | Paper |
Complexity of an homotopy method at the neighbourhood of a zero
SEMA SIMAI Springer Series | 2016-11-15 | Paper |
The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) | 2015-09-01 | Paper |
Multiplicity hunting and approximating multiple roots of polynomial systems
Recent Advances in Real Complexity and Computation | 2015-08-04 | Paper |
Obituary: Jean-Pierre Dedieu, 1949-2012
Journal of Complexity | 2012-10-10 | Paper |
| On an index reduction method by deflation for differential-algebraic equations | 2011-09-17 | Paper |
A subdivision method for computing nearest gcd with certification
Theoretical Computer Science | 2011-09-12 | Paper |
On location and approximation of clusters of zeros: Case of embedding dimension one
Foundations of Computational Mathematics | 2007-03-12 | Paper |
On location and approximation of clusters of zeros of analytic functions
Foundations of Computational Mathematics | 2006-09-28 | Paper |
Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
Journal of Complexity | 2005-12-27 | Paper |
| scientific article; zbMATH DE number 1859224 (Why is no real title available?) | 2003-04-23 | Paper |
On the complexity of isolating real roots and computing with certainty the topological degree
Journal of Complexity | 2002-09-30 | Paper |
Finding a cluster of zeros of univariate polynomials
Journal of Complexity | 2001-07-05 | Paper |
Accelerated shift-and-add algorithms
Reliable Computing | 2000-09-04 | Paper |
Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods
Journal of Complexity | 2000-05-07 | Paper |
Contraction, robustness, and numerical path-following using secant maps.
Journal of Complexity | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 953018 (Why is no real title available?) | 1997-01-07 | Paper |
| scientific article; zbMATH DE number 810989 (Why is no real title available?) | 1996-02-04 | Paper |
A universal constant for the convergence of Newton's method and an application to the classical homotopy method
Numerical Algorithms | 1995-08-13 | Paper |
| scientific article; zbMATH DE number 202545 (Why is no real title available?) | 1994-08-18 | Paper |
Approximating the zeros of analytic functions by the exclusion algorithm
Numerical Algorithms | 1994-04-10 | Paper |
Computing the real roots of a polynomial by the exclusion algorithm
Numerical Algorithms | 1993-05-16 | Paper |
The Sturm method in the complex case
Journal of Pure and Applied Algebra | 1993-05-16 | Paper |
Localization of an algebraic hypersurface by the exclusion algorithm
Applicable Algebra in Engineering, Communication and Computing | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 29201 (Why is no real title available?) | 1992-06-27 | Paper |
On Newton's rule and Sylvester's theorems
Journal of Pure and Applied Algebra | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4078647 (Why is no real title available?) | 1989-01-01 | Paper |
