Foundations Of Computational Mathematics, Proceedings Of Smalefest 2000Felipe Cucker, J Maurice Rojas World Scientific, 25. feb. 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 (”From Topology to Computation”) 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
| 1 | |
| 15 | |
Data Compression and Adaptive Histograms | 35 |
Bifurcations of Limit Cycles in ZqEquivariant Planar Vector Fields of Degree 5 | 61 |
Systems of Inequalities and the Stability of Decision Machines | 85 |
Reconciliation of Various Complexity and Condition Measures for Linear Programming Problems and a Generalization of Tardos Theorem ... | 93 |
On the Expected Number of Real Roots of a System of Random Polynomial Equations | 149 |
Almost Periodicity and Distributional Chaos | 189 |
Asymptotic Acceleration of the Solution of Multivariate Polynomial Systems of Equations | 267 |
IBCProblems Related to Steve Smale | 295 |
On Sampling Integer Points in Polyhedra | 319 |
Splitting a Univariate Polynomial into Factors over an Annulus | 325 |
Complexity Issues in Dynamic Geometry | 355 |
GraceLike Polynomials | 405 |
From Dynamics to Computation and Back? | 423 |
Simultaneous Computation of All the ZeroClusters of a Univariate Polynomial | 433 |
Polynomials of Bounded TreeWidth | 211 |
Polynomial Systems and the Momentum Map | 251 |
CrossConstrained Variational Problem and Nonlinear Schrodinger Equation | 457 |
Almindelige termer og sætninger
algebraic algorithm angular bisectors apply approximate arithmetic operations assume Bezout's theorem bifurcation bound coefficients computation condition number consider constant construction Corollary corresponding decision problem decomposition defined definition denote eaſpected equations error estimate evaluation exists expected number factors feasible finite formula free points G-nomial Gegenbauer polynomials geometry given Hamiltonian Hamiltonian system hypergraphs idempotents implies inequality input integer iteration Lemma lifting function limit cycles linear LP problems Math Mathematics matrix measure monomials morphism MSOR nonlinear Schrödinger equation NP-hard number of real obtain optimal solution oriented matroids orthogonally invariant Padé approximation parameter polynomial systems polytope positive proof of Theorem Proposition prove PSPACE-hard random polynomials real numbers real zeros resp Rºº 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