Foundations of Computational Mathematics
Selected Papers of a Conference Held at Rio de Janeiro, January 1997
-
20% KEDVEZMÉNY?
- A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
- Kiadói listaár EUR 106.99
-
44 374 Ft (42 261 Ft + 5% áfa)
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.
- Kedvezmény(ek) 20% (cc. 8 875 Ft off)
- Kedvezményes ár 35 499 Ft (33 809 Ft + 5% áfa)
Iratkozzon fel most és részesüljön kedvezőbb árainkból!
Feliratkozom
44 374 Ft
Beszerezhetőség
Becsült beszerzési idő: A Prosperónál jelenleg nincsen raktáron, de a kiadónál igen. Beszerzés kb. 3-5 hét..
A Prosperónál jelenleg nincsen raktáron.
Why don't you give exact delivery time?
A beszerzés időigényét az eddigi tapasztalatokra alapozva adjuk meg. Azért becsült, mert a terméket külföldről hozzuk be, így a kiadó kiszolgálásának pillanatnyi gyorsaságától is függ. A megadottnál gyorsabb és lassabb szállítás is elképzelhető, de mindent megteszünk, hogy Ön a lehető leghamarabb jusson hozzá a termékhez.
A termék adatai:
- Kiadás sorszáma Softcover reprint of the original 1st ed. 1997
- Kiadó Springer Berlin Heidelberg
- Megjelenés dátuma 1996. december 17.
- Kötetek száma 1 pieces, Book
- ISBN 9783540616474
- Kötéstípus Puhakötés
- Terjedelem441 oldal
- Méret 235x155 mm
- Súly 705 g
- Nyelv angol
- Illusztrációk XV, 441 p. 11 illus. Illustrations, black & white 0
Kategóriák
Hosszú leírás:
"This book contains a collection of articles corresponding to some of the talks delivered at the Foundations of Computational Mathematics conference held at IMPA in Rio de Janeiro in January 1997. Some ofthe others are published in the December 1996 issue of the Journal of Complexity. Both of these publications were available and distributed at the meeting. Even in this aspect we hope to have achieved a synthesis of the mathematics and computer science cultures as well as of the disciplines. The reaction to the Park City meeting on Mathematics of Numerical Analy sis: Real Number Algorithms which was chaired by Steve Smale and had around 275 participants, was very enthusiastic. At the suggestion of Narendra Karmar mar a lunch time meeting of Felipe Cucker, Arieh Iserles, Narendra Karmarkar, Jim Renegar, Mike Shub and Steve Smale decided to try to hold a periodic meeting entitled ""Foundations of Computational Mathematics"" and to form an organization with the same name whose primary purpose will be to hold the meeting. This is then the first edition of FoCM as such. It has been organized around a small collection of workshops, namely - Systems of algebraic equations and computational algebraic geometry - Homotopy methods and real machines - Information-based complexity - Numerical linear algebra - Approximation and PDEs - Optimization - Differential equations and dynamical systems - Relations to computer science - Vision and related computational tools There were also twelve plenary speakers. This proceedings volume of a new mathematical conference contains contributions from all fields of mathematics and theoretical computer science that are concerned with computation. It is a very foward-looking publication with first-rate authors."
TöbbTartalomjegyzék:
Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract).- Essentially Smooth Lipschitz Functions: Compositions and Chain Rules.- Junction Detection and Filtering.- Recognition in Hierarchical Models.- Continuity ?—Algebras (Extended Abstract).- Condition Number Analysis for Sparse Polynomial Systems.- Residues in the Torus and Toric Varieties.- Piecewise Smooth Orthonormal Factors for Fundamental Solution Matrices.- Algorithms for computing finite semigroups.- Extended Grzegorczyk Hierarchy in the BSS Model of Computability.- Affine-Invariant Symmetry Sets.- On the Qualitative Properties of Modified Equations.- Numerical Methods on (and off) Manifolds.- On One Computational Scheme Solving the Nonstationary Schrödinger Equation with Polynomial Nonlinearity.- Newton Iteration Towards a Cluster of Polynomial Zeros.- Szemerédi’s Regularity Lemma for Sparse Graphs.- Questions on Attractors of 3-Manifolds.- A Trust-Region SLCP Model Algorithm for Nonlinear Programming.- On the height used by additives BSS machines.- The Space Complexity of Elimination Theory: Upper Bounds.- Global Stochastic Recursive Algorithms.- Dynamical Recognizers: Real-time Language Recognition by Analog Computers (Extended Abstract).- Solving special polynomial systems by using structured matrices and algebraic residues.- Numerical Integration of Differential Equations on Homogeneous Manifolds.- A Convergence proof of an Iterative Subspace Method for Eigenvalues Problems.- Regularity of Minimizers of the Mumford-Shah Functional.- Tests and Constructions of Irreducible Polynomials over Finite Fields.- Numerical Linear Algebra in Optical Imaging.- Explicit symplectic integration of rod dynamics.- Toric Laminations, Sparse Generalized Characteristic Polynomials, and a Refinementof Hilbert’s Tenth Problem.- Finite-Dimensional Feedback Control of a Scalar Reaction-Diffusion Equation via Inertial Manifold Theory.- Computational aspects of jacobian matrices.- Rigid body dynamics and measure differential inclusions.- Linear decision lists and partitioning algorithms for the construction of neural networks.- Ill-Posedness and Finite Precision Arithmetic: A Complexity Analysis for Interior Point Methods.- Iterated Commutators, Lie’s Reduction Method and Ordinary Differential Equations on Matrix Lie Groups.
Több
