Salac: Fast Marching Methods: Time Advancement and...
May
16
Fri 2:00 PM
When Friday, May 16, 2008
Time
2:00 PM - 3:00 PM
Where Tech M416
Contact Alvin Bayliss
847-491-7221
Group McCormick-Colloquia Engineering Sciences and Applied Mathematics
Applied Math Colloquium
Title: Fast Marching Methods: Time Advancement and Non-Graded Cartesian Grids
Speaker: David Salac, Department of Engineering Sciences and Applied Mathematics, Northwestern University
Abstract: Previous implementations of the fast marching method for level sets have been limited to the reinitialization and velocity extension procedures. Here the fast marching method is adapted for use as a time-advancement scheme. The scheme avoids the time-step restrictions of standard PDE-based level set advancement and is capable of modeling interface velocities which contain a sign change. Unlike other unconditionally-stable time-advancement methods, such as the semi-implicit level set method, it is not necessary to solve a non-linear set of implicit equations. This fast marching method scheme will also be demonstrated for use on non-graded Cartesian grids with adaptive remeshing. We use quadtree data structures and an automated meshing algorithm to describe general shapes in two dimensions. Combining the fast marching method with non-graded Cartesian grids results in a scheme which is both fast and memory efficient. This will allow for the investigation of material systems which would be difficult using other methods. This talk is part of the ESAM RTG seminar series.
Title: Fast Marching Methods: Time Advancement and Non-Graded Cartesian Grids
Speaker: David Salac, Department of Engineering Sciences and Applied Mathematics, Northwestern University
Abstract: Previous implementations of the fast marching method for level sets have been limited to the reinitialization and velocity extension procedures. Here the fast marching method is adapted for use as a time-advancement scheme. The scheme avoids the time-step restrictions of standard PDE-based level set advancement and is capable of modeling interface velocities which contain a sign change. Unlike other unconditionally-stable time-advancement methods, such as the semi-implicit level set method, it is not necessary to solve a non-linear set of implicit equations. This fast marching method scheme will also be demonstrated for use on non-graded Cartesian grids with adaptive remeshing. We use quadtree data structures and an automated meshing algorithm to describe general shapes in two dimensions. Combining the fast marching method with non-graded Cartesian grids results in a scheme which is both fast and memory efficient. This will allow for the investigation of material systems which would be difficult using other methods. This talk is part of the ESAM RTG seminar series.
