2007 |
9 | EE | Marc Giusti,
Grégoire Lecerf,
Bruno Salvy,
Jean-Claude Yakoubsohn:
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One.
Foundations of Computational Mathematics 7(1): 1-58 (2007) |
2005 |
8 | EE | Marc Giusti,
Grégoire Lecerf,
Bruno Salvy,
Jean-Claude Yakoubsohn:
On Location and Approximation of Clusters of Zeros of Analytic Functions.
Foundations of Computational Mathematics 5(3): 257-311 (2005) |
7 | EE | Jean-Claude Yakoubsohn:
Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions.
J. Complexity 21(5): 652-690 (2005) |
2002 |
6 | EE | Bernard Mourrain,
Michael N. Vrahatis,
Jean-Claude Yakoubsohn:
On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree.
J. Complexity 18(2): 612-640 (2002) |
2000 |
5 | EE | Jean-Claude Yakoubsohn:
Contraction, Robustness, and Numerical Path-Following Using Secant Maps.
J. Complexity 16(1): 286-310 (2000) |
4 | EE | Jean-Claude Yakoubsohn:
Finding a Cluster of Zeros of Univariate Polynomials.
J. Complexity 16(3): 603-638 (2000) |
3 | EE | Nathalie Revol,
Jean-Claude Yakoubsohn:
Accelerated Shift-and-Add Algorithms.
Reliable Computing 6(2): 193-205 (2000) |
1999 |
2 | EE | Jean-Claude Yakoubsohn:
Finding Zeros of Analytic Functions: alpha Theory for Secant Type Methods.
J. Complexity 15(2): 239-281 (1999) |
1991 |
1 | | Jean-Pierre Dedieu,
Jean-Claude Yakoubsohn:
Localization of an Algebraic Hypersurface by the Exclusion Algorithm.
Appl. Algebra Eng. Commun. Comput. 2: 239-256 (1991) |