| Type of Document |
Dissertation |
| Author |
Kuster, Christopher M., |
| URN |
etd-04262006-083221 |
| Title |
Fast Numerical Methods for Evolving Interfaces |
| Degree |
PhD |
| Graduate Program |
Computational Mathematics |
| Advisory Committee |
| Advisor Name |
Title |
| Pierre A. Gremaud |
Committee Chair |
| Carl T. Kelley |
Committee Member |
| Stephen L. Campbell |
Committee Member |
| Zhilin Li |
Committee Member |
|
| Keywords |
- free boundary
- moving boundary
- eikonal equation
- sand piles
|
| Date of Defense |
2006-04-26 |
| Availability |
unrestricted |
Abstract
Free and/or moving boundary problems occur in a wide range of applications. These boundaries can obey either local or global conditions. In this dissertation, new numerical techniques for solving some of these problems are developed, analyzed, implemented and tested. The new techniques for free and moving boundary problems are 1) a second order method for solving moving boundary problems and 2) a hybrid level set/boundary element method for solving some free boundary problems. The main tool used in both is the Fast Marching method, a fast algorithm for solving the eikonal equation. An application using Fast Marching to solve a model for sand pile formation in domains with obstacles is shown. A new, second order Fast Marching scheme for domains with obstacles is introduced. We look at the stability and accuracy of discretizations commonly used with Fast Marching. The performance of Fast Marching is compared that of Fast Sweeping, another eikonal solver. The second order method for solving moving boundary problems is applied to some simple examples. Finally, a globally defined free boundary problem inspired by fluid dynamics, the Bernoulli problem, is solved using the hybrid method.
|
| Files |
| Filename |
Size |
Approximate Download Time
(Hours:Minutes:Seconds)
|
| 28.8 Modem |
56K Modem |
ISDN (64 Kb) |
ISDN (128 Kb) |
Higher-speed Access |
| |
etd.pdf |
7.21 Mb |
00:33:21 |
00:17:09 |
00:15:00 |
00:07:30 |
00:00:38 |
|
