Foundations of Computational Mathematics, Minneapolis 2002

Voorkant
Felipe Cucker
Cambridge University Press, 25 mrt. 2004 - 206 pagina's
0 Recensies
The Foundations of Computational Mathematics meetings are a platform for cross-fertilization between numerical analysis, mathematics and computer science. This volume contains the invited presentations, given by some of the leading authorities in the world, and topics surveyed range from partial differential equations to image processing, biology, complexity, number theory and algebraic geometry. The volume will be essential reading for all those wishing to be informed of the state-of-the-art in computational mathematics.
  

Wat mensen zeggen - Een recensie schrijven

We hebben geen recensies gevonden op de gebruikelijke plaatsen.

Geselecteerde pagina's

Inhoudsopgave

Some Fundamental Issues
1
Jacobi Sets
37
Approximation of boundary element operators
58
Quantum Complexity
76
Straightline Programs
96
Numerical Solution of Structured Problems
137
Detecting Infeasibility
157
Maple Packages and Java Applets
193
Copyright

Veelvoorkomende woorden en zinsdelen

Populaire passages

Pagina 191 - Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming,

Over de auteur (2004)

Felipe Cucker is Chair Professor of Mathematics at the City University of Hong Kong. His research covers a variety of subjects including semi-algebraic geometry, computer algebra, complexity, emergence in decentralized systems (in particular, emergence of languages and flocking), learning theory, and foundational aspects of numerical analysis. He serves on the editorial board of several journals and is Managing Editor of the journal Foundations of Computational Mathematics, published by the society of the same name.

Bibliografische gegevens