MGA Workshop II: Multiscale Geometry in Scientific Computing - IPAM

MGA Workshop II: Multiscale Geometry in Scientific Computing

Part of the Long Program Multiscale Geometry and Analysis in High Dimensions
October 19 - 23, 2004

Schedule

All times in this Schedule are Pacific Time (PT)

Tuesday, October 19, 2004

Morning Session

08:30-9:15
Check-In/Light Breakfast (Hosted by IPAM)
09:15-9:30
Welcome and Opening Remarks
09:30-10:30
Martin Mohlenkamp (Ohio University)
Algorithms for Numerical Analysis in High Dimensions. Part I: Definitions, linear algebra and basic algorithms
10:30-11:00
Break
11:00-12:00
Gregory Beylkin (University of Colorado Boulder)
Algorithms for Numerical Analysis in High Dimensions Part II: Operators in high dimensions

Afternoon Session

12:00-1:30
Lunch (on your own)
13:30-14:30
George Fann (Oak Ridge National Laboratory)
Multiresolution Solvers in MADNESS
14:30-15:00
Break
15:00-16:00
Nick Coult (Augsburgh College)
Multiresolution homogenization of operators in separated form
16:00-16:30
Break
16:30-17:30
Robert Harrison (Oak Ridge National Laboratory)
Chemistry in many dimensions

Wednesday, October 20, 2004

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:30
Eric Michielssen (University of Illinois at Urbana-Champaign)
Plane Wave Time Domain Accelerated Integral Equation Solvers: Multiscale Aspects
10:30-11:00
Break
11:00-12:00
Richard Tsai (University of Texas at Austin)
Visibility Optimizations

Afternoon Session

12:00-1:30
Lunch (on your own)
13:30-14:30
Thomas Hou (California Institute of Technology)
Multiscale computations for flow in strongly heterogeneous media
14:30-15:00
Break
15:00-16:00
Michael Ortiz (California Institute of Technology)
Title not available
16:00-16:30
Break
16:30-17:30
Achi Brandt (Weizmann Institute of Science)
Multiscale Computation: From fast solvers to systematic upscaling
17:30-19:00
Wine/Cheese Reception (Hosted by IPAM)

Thursday, October 21, 2004

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:30
Stanley Osher (University of California, Los Angeles (UCLA))
Computing Multivalued Physical Observables for the Semiclassical Limit of the Schrodinger Equation and for High Frequency Asymptotic Solutions to Symmetric Hyperbolic Systems (joint with S. Jin, H. Liu and R. Tsai)
10:30-11:00
Break
11:00-12:00
Vladimir Rokhlin (Yale University)
Moore's Law and ``Fast'' Numerical Techniques

Afternoon Session

12:00-1:30
Lunch (Hosted by IPAM)
13:30-14:30
Gilad Lerman (University of Minnesota, Twin Cities)
Multiscale Curve and Strip Constructions with Applications
14:30-15:00
Break
15:00-16:00
Eric Vanden-Eijnden (New York University)
Extracting low order stochastic models from large-sized dynamical data sets.
16:00-16:30
Break
16:30-17:30
Lexing Ying (California Institute of Technology)
A kernel-independent adaptive fast multipole algorithm in two and three dimensions

Friday, October 22, 2004

Morning Session

08:30-09:00
Continental Breakfast
09:00-10:00
Peter Schröder (California Institute of Technology)
Conforming hierarchical adaptive refinement methods (CHARMS) and their application in the context of thin-shell simulation with the subdivision element method.
10:00-10:15
Break
10:15-11:15
Yannis Kevrekides (Princeton University)
Equation-Free Modeling for Complex Multiscale Systems
11:15-11:30
Break
11:30-12:30
Yuval Rabani (Technion - Israel Institute of Technology)
Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs

Afternoon Session

12:30-2:00
Lunch (on your own)
14:00-15:00
Nathan (Nati) Linial (Hebrew University)
Clustering - Can we tame the beast?
15:00-15:15
Break
15:15-16:15
Anna Gilbert (University of Michigan)
Beating the B^2 bottleneck in estimating B-term Fourier representations
16:15-16:30
Break
16:30-17:30
Leonard Schulman (California Institute of Technology)
Deterministic Clustering with Data Nets
17:30-18:30
Santosh Vempala (Georgia Institute of Technology)
Random Sampling for Matrix Projection and Approximation

Saturday, October 23, 2004

Morning Session

08:30-09:30
Continental Breakfast
09:30-10:30
Emmanuel Candes (Stanford University)
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
10:30-11:00
Break
11:00-12:00
Piotr Indyk (Massachusetts Institute of Technology)
Near Neighbor Search in High Dimensions via Locality Sensitive Hashing

Afternoon Session

12:00-13:30
Lunch (on your own)
13:30-14:30
Rafail Ostrovsky (University of California, Los Angeles (UCLA))
Dimension-Reductions in The Hamming Cube and its Applications
Printable Version