A one-dimensional, single phase Stefan Problem is considered. This problem is shown to have a unique solution which depends continuously on the boundary data. In addition two algorithms are formulated for its approximate numerical solution. The first algorithm (the Similarity Algorithm), which is based on Similarity, is shown to converge with order of convergence between one half and one. Moreover, numerical examples illustrating various aspects of this algorithm are presented. In particular, modifications to the algorithm which are suggested by the proof of convergence are shown to improve the numerical results significantly. Furthermore, a brief comparison is made between the algorithm and a well-known difference scheme. The second algorithm (a Collocation Scheme) results from an attempt to reduce the problem to a set of ordinary differential equations. It is observed that this set of ordinary differential equations is stiff. Moreover, numerical examples indicate that this is a high order scheme capable of achieving very accurate approximations. It is observed that the apparent stiffness of the system of ordinary differential equations renders this second algorithm relatively inefficient. / Science, Faculty of / Statistics, Department of / Graduate
| Identifer | oai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/19068 |
| Date | January 1974 |
| Creators | Milinazzo, Fausto |
| Source Sets | University of British Columbia |
| Language | English |
| Detected Language | English |
| Type | Text, Thesis/Dissertation |
| Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
Page generated in 0.0021 seconds