Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Dedieu, Jean-Pierre"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note about the average number of real roots of a Bernstein polynomial system
Diego Armentano
,
Jean-Pierre Dedieu
Journal of Complexity
25
(4), 2009, pp. 339-342
Smale's point estimate theory for Newton's method on Lie groups
Chong Li
,
Jin-Hua Wang
,
Jean-Pierre Dedieu
Journal of Complexity
25
(2), 2009, pp. 128-151
On the number of minima of a random polynomial
Jean-Pierre Dedieu
,
Gregorio Malajovich
Journal of Complexity
24
(2), 2008, pp. 89-108
Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
Jean-Pierre Dedieu
,
Dmitry Nowicki
Journal of Complexity
21
(4), 2005, pp. 487-501
Newton's method for analytic systems of equations with constant rank derivatives
Jean-Pierre Dedieu
,
Myong-Hi Kim
Journal of Complexity
18
(1), 2002, pp. 187-209
Newton's method and some complexity aspects of the zero-finding problem
Jean-Pierre Dedieu
London Mathematical Society Lecture Note Series
284
, 2001, pp. 45-67
Some lower bounds for the complexity of continuation methods
Jean-Pierre Dedieu
,
Steve Smale
Journal of Complexity
14
(4), 1998, pp. 454-465
Condition number analysis for sparse polynomial systems
Jean-Pierre Dedieu
Proceedings of the International Conference on Foundations of Computational Mathematics, FoCM'97 (Rio de Janeiro, Brazil, January 5-12, 1997)
, 1997, pp. 75-101
Estimations for the separation number of a polynomial system
Jean-Pierre Dedieu
Journal Symbolic Computation
24
(6), 1997, pp. 683-693
Stewart varieties: A direct algebraic model for Stewart platforms
Jean-Pierre Dedieu
,
Graham Norton
SIGSAM Bulletin
24
(4), 1990, October, pp. 42-59