Foundations of Computational Mathematics: Proceedings of the Smalefest 2000, Hong Kong, 13-17, 2000Felipe Cucker, Joseph Maurice Rojas World Scientific, 2002 - 480 sider This invaluable book contains 19 papers selected from those submitted to a conference held in Hong Kong in July 2000 to celebrate the 70th birthday of Professor Steve Smale. It may be regarded as a continuation of the proceedings of SMALEFEST 1990 (OCOFrom Topology to ComputationOCO) held in Berkeley, USA, 10 years before, but with the focus on the area in which Smale worked more intensively during the ''90''s, namely the foundations of computational mathematics." |
Indhold
Foreword | 1 |
19901999 | 15 |
Data Compression and Adaptive Histograms | 35 |
Bifurcations of Limit Cycles in ZEquivariant Planar Vector Fields | 61 |
of Degree 5 | 79 |
Reconciliation of Various Complexity and Condition Measures for 933 | 93 |
On the Expected Number of Real Roots of a System of Random | 149 |
Almost Periodicity and Distributional Chaos | 189 |
Polynomial Systems and the Momentum Map | 251 |
Asymptotic Acceleration of the Solution of Multivariate Polynomial | 267 |
IBCProblems Related to Steve Smale | 295 |
On Sampling Integer Points in Polyhedra | 319 |
Complexity Issues in Dynamic Geometry | 355 |
GraceLike Polynomials | 405 |
From Dynamics to Computation and Back? | 423 |
CrossConstrained Variational Problem and Nonlinear Schrödinger | 457 |
Andre udgaver - Se alle
Almindelige termer og sætninger
algebraic algorithm angular bisectors apply approximate arithmetic operations assume B₁ Bezout's theorem bifurcation bound coefficients computation condition number consider constant construction Corollary corresponding decision problem decomposition defined definition denote equations error estimate evaluation exists expected number factors feasible finite formula free points G-nomial Gegenbauer polynomials geometry given Hamiltonian hypergraphs idempotents implies inequality input integer iteration Lemma lifting function limit cycles linear LP problems Lyapunov exponents Math Mathematics matrix measure monomials morphism MSOR multivariate NP-hard number of real obtain optimal solution orthogonally invariant Padé Padé approximation parameter polynomial systems polytope positive proof of Theorem Proposition prove PSPACE-hard random polynomials real numbers real zeros resp satisfies scrambled set semistable sequence Shub Smale solve space Steve Smale structure subset tensor product theory tree-width unit circle values variables vector Woźniakowski