Analysis of Monotone Numerical Schemes
| dc.contributor.author | Nosov, Vladimir | |
| dc.contributor.examiningcommittee | Jeffrey, Ian (Electrical and Computer Engineering) | en_US |
| dc.contributor.supervisor | Kirkland, Stephen (Mathematics) Lui, Shaun (Mathematics) | en_US |
| dc.date.accessioned | 2016-09-16T14:40:32Z | |
| dc.date.available | 2016-09-16T14:40:32Z | |
| dc.date.issued | 2016 | |
| dc.degree.discipline | Mathematics | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | In the study of partial differential equations (PDEs) one rarely finds an analytical solution. But a numerical solution can be found using different methods such as finite difference, finite element, etc. The main issue using such numerical methods is whether the numerical solution will converge to the “real" analytical solution and if so how fast will it converge as we shrink the discretization parameter. In the first part of this thesis discrete versions of well known inequalities from analysis are used in proving the convergence of certain numerical methods for the one dimensional Poisson equation with Dirichlet boundary conditions and with Neumann boundary conditions. A matrix is monotone if its inverse exists and is non-negative. In the second part of the thesis we will show that finite difference discretization of two PDEs result in monotone matrices. The monotonicity property will be used to demonstrate stability of certain methods for the Poisson and Biharmonic equations. Convergence of all schemes is also shown. | en_US |
| dc.description.note | October 2016 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1993/31790 | |
| dc.language.iso | eng | en_US |
| dc.rights | open access | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Analysis of Monotone Numerical Schemes | en_US |
| dc.type | master thesis | en_US |