Solving a polynomial equation: some history and recent progress

VY Pan - SIAM review, 1997 - SIAM
The classical problem of solving an nth degree polynomial equation has substantially
influenced the development of mathematics throughout the centuries and still has several …

Mathematical problems for the next century

S Smale - The mathematical intelligencer, 1998 - Springer
Some of these problems are well known. In fact, included are what I believe to be the three
greatest open problems of mathematics: the Riemann Hypothesis, the Poincar~ Conjecture …

[图书][B] Condition: The geometry of numerical algorithms

P Bürgisser, F Cucker - 2013 - books.google.com
This book gathers threads that have evolved across different mathematical disciplines into
seamless narrative. It deals with condition as a main aspect in the understanding of the …

Newton's method on Riemannian manifolds and a geometric model for the human spine

RL Adler, JP Dedieu, JY Margulies… - IMA Journal of …, 2002 - academic.oup.com
To study a geometric model of the human spine we are led to finding a constrained minimum
of a real valued function defined on a product of special orthogonal groups. To take …

Computing the edit-distance between unrooted ordered trees

PN Klein - European Symposium on Algorithms, 1998 - Springer
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of
the tree as being embedded in the plane. Let A and B be two ordered trees. The edit …

[图书][B] Complexity and information

JF Traub, AG Werschulz - 1998 - books.google.com
The twin themes of computational complexity and information pervade this 1998 book. It
starts with an introduction to the computational complexity of continuous mathematical …

[图书][B] Electrical transmission system cascades and vulnerability: an operations research viewpoint

D Bienstock - 2015 - SIAM
This monograph explores mathematical issues related to vulnerability analysis of power
grids, with a focus on optimization methods. The target audience is primarily made up of …

Straight-line programs in geometric elimination theory

M Giusti, J Heintz, JE Morais, J Morgenstem… - Journal of pure and …, 1998 - Elsevier
We present a new method for solving symbolically zero-dimensional polynomial equation
systems in the affine and toric case. The main feature of our method is the use of problem …

Complexity of Bézout's theorem IV: probability of success; extensions

M Shub, S Smale - SIAM Journal on Numerical Analysis, 1996 - SIAM
We estimate the probability that a given number of projective Newton steps applied to a
linear homotopy of a system of n homogeneous polynomial equations in n+1 complex …

Complexity theory and numerical analysis

S Smale - Acta numerica, 1997 - cambridge.org
Complexity theory and numerical analysis Page 1 Acta Numerica (1997), pp. 523-551 ©
Cambridge University Press, 1997 Complexity theory and numerical analysis Steve Smale …