Sunday, July 21, 1996
Organizer: James Sethian
University of California, Berkeley, and Lawrence Berkeley National Laboratory
This course is an equal blend of theory, algorithms, and applications. It will highlight robust and efficient algorithms for the above applications, as well as many others. Along the way, we will introduce and cover a variety of related topics necessary to build these algorithms, including approximation of viscosity solutions to partial differential equations, the numerical technology from hyperbolic conservation laws, and fast heapsort algorithms for special cases arising from stationary Hamilton-Jacobi equations.
|8:45||Welcome Remarks: James A. Sethian|
|9:00-10:00||Overview of Level Set Methods. How to Track a Moving Front: Theory and Algorithms|
|10:30-12:00||Fast Techniques: Computational Adaptivity and Fast Marching Methods|
|1:30-3:00||Applications I: The Geometry of Moving Curves and Surfaces, Geodesics on Surfaces, Sharpening Noisy Images, and Locating Structures in Medical Imaging|
|3:30-5:00||Applications II: Making Microchips, Following Rising Bubbles, Tracking Flames, and Computing Robotic Paths|
|Pregistration (Before 7/8/96)||$150||$190||$70|
|Registration (After 7/8/96)||$190||$230||$85|
Registration fees will include a recently published book on Level Set Methods by James Sethian, course notes, and lunch. To register for the short course, conference or both, complete the preregistration form.
Back to AN96 Homepage