Localised Radial Basis Function Methods for Partial Differential Equations
- Date: 1/19/2018 at 10:15 AM
- Location: ITC 2446, Polacksbacken, Lägerhyddsvägen 2, Uppsala
- Lecturer: Shcherbakov, Victor
- Organiser: Avdelningen för beräkningsvetenskap
- Contact person: Shcherbakov, Victor
In this thesis radial basis function partition of unity methods for partial differential equations arising in financial mathematics and glaciology was developed.
Radial basis function methods exhibit several very attractive properties such as a high order convergence of the approximated solution and flexibility to the domain geometry. However the method in its classical formulation becomes impractical for problems with relatively large numbers of degrees of freedom due to the ill-conditioning and dense structure of coefficient matrix. To overcome the latter issue we employ a localisation technique, namely a partition of unity method, while the former issue was previously addressed by several authors and was of less concern in this thesis.
In this thesis we develop radial basis function partition of unity methods for partial differential equations arising in financial mathematics and glaciology. In the applications of financial mathematics we focus on pricing multi-asset equity and credit derivatives whose models involve several stochastic factors. We demonstrate that localised radial basis function methods are very effective and well-suited for financial applications thanks to the high order approximation properties that allow for the reduction of storage and computational requirements, which is crucial in multi-dimensional problems to cope with the curse of dimensionality. In the glaciology application we in the first place make use of the meshfree nature of the methods and their flexibility with respect to the irregular geometries of ice sheets and glaciers. Also, we exploit the fact that radial basis function methods are stated in strong form, which is advantageous for approximating velocity fields of non-Newtonian viscous liquids such as ice, since it allows to avoid a full coefficient matrix reassembly within the nonlinear iteration.
In addition to the applied problems we develop a least squares radial basis function partition of unity method that is robust with respect to the node layout. The method allows for scaling to problem sizes of a few hundred thousand nodes without encountering the issue of large condition numbers of the coefficient matrix. This property is enabled by the possibility to control the coefficient matrix condition number by the rate of oversampling and the mode of refinement.