| 2008 |
|---|
| 12 | EE | Jean-Pierre Dedieu,
Gregorio Malajovich:
On the number of minima of a random polynomial.
J. Complexity 24(2): 89-108 (2008) |
| 2005 |
|---|
| 11 | EE | Jean-Pierre Dedieu,
Gregorio Malajovich,
Mike Shub:
On the Curvature of the Central Path of Linear Programming Theory.
Foundations of Computational Mathematics 5(2): 145-171 (2005) |
| 10 | EE | Jean-Pierre Dedieu,
Mike Shub:
Newton Flow and interior Point Methods in Linear Programming.
I. J. Bifurcation and Chaos 15(3): 827-839 (2005) |
| 9 | EE | Jean-Pierre Dedieu,
Dmitry Nowicki:
Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds.
J. Complexity 21(4): 487-501 (2005) |
| 2003 |
|---|
| 8 | EE | Françoise Tisseur,
Jean-Pierre Dedieu,
Myong-Hi Kim,
Michael Shub:
Implicit Gamma Theorems (I): Pseudoroots and Pseudospectra.
Foundations of Computational Mathematics 3(1): 1-31 (2003) |
| 2002 |
|---|
| 7 | EE | Jean-Pierre Dedieu,
Myong-Hi Kim:
Newton's Method for Analytic Systems of Equations with Constant Rank Derivatives.
J. Complexity 18(1): 187-209 (2002) |
| 2001 |
|---|
| 6 | | Jean-Pierre Dedieu,
Mike Shub:
On simple double zeros and badly conditioned zeros of analytic functions of n variables.
Math. Comput. 70(233): 319-327 (2001) |
| 2000 |
|---|
| 5 | EE | Jean-Pierre Dedieu,
Pascal Koiran:
Guest Editors' Preface.
J. Complexity 16(3): 528 (2000) |
| 4 | | Jean-Pierre Dedieu,
Mike Shub:
Multihomogeneous Newton methods.
Math. Comput. 69(231): 1071-1098 (2000) |
| 3 | | Jean-Pierre Dedieu,
Mike Shub:
Newton's method for overdetermined systems of equations.
Math. Comput. 69(231): 1099-1115 (2000) |
| 1998 |
|---|
| 2 | EE | Jean-Pierre Dedieu,
Steve Smale:
Some Lower Bounds for the Complexity of Continuation Methods.
J. Complexity 14(4): 454-465 (1998) |
| 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) |
