Abstract

This thesis presents a new class of collocation methods for the approximate numerical solution of linear parabolic partial differential equations. In the time dimension, the partial derivative with respect to time is replaced by finite differences, to form the implicit Euler method. At each time step, a polynomial approximating the exact solution is calculated for each triangular finite element created by the Rivara algorithm. Polynomials of adjacent finite elements have matching values and matching normal derivatives at a set of discrete points, called "matching points". The method of nested dissection is used to eliminate all variables at the interior matching points of the domain. The maximum error of the solution is of the order of the time step size, which is O ( dt ), except when dt is sufficiently small. In that case, the maximum error can be very small, depending on the density of the space mesh. An application based on OpenGL and Motif to visualize the solutions is also described in this thesis. Extensive numerical results, pictures of refined meshes, and 3 D representations of the solutions are given

Document Downloads