- Complexity of numerican computations
- homotopy methods
- optimization and interior point methods
- differential equations.
Image courtesy of Scott Sutherland, SUNY Stony Brook
- Complexity: What is the 'cost' inherent in a computational problem that no algorithm can circumvent?
- Optimization: How to find the best value of a function (or a functional) subject to constraints?
- Homotopy: How does the knowledge of the solution of a `nearby' problem assist us to compute the problem in hand?
- Geometric integration: How to compute approximate solutions that share qualitative properties with the true solution of the problem?
|November 02, 1998 - November 06, 1998||Complexity of Continuous and Algebraic Mathematics|
|August 17, 1998 - August 26, 1998||Introductory Workshop on Foundations of Computational Mathematics and Symbolic Computation in Geometry and Analysis|