Foundations of Computational Mathematics, Minneapolis 2002

Front Cover
Cambridge University Press, Mar 25, 2004 - Mathematics - 206 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

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

Common terms and phrases

Popular passages

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

About the author (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.

Bibliographic information