Computing Failure Probabilities for PDEs with Random Data
| dc.contributor.author | Eklund, Oskar | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för matematiska vetenskaper | sv |
| dc.contributor.examiner | Lang, Annika | |
| dc.contributor.supervisor | Målqvist, Axel | |
| dc.date.accessioned | 2020-08-14T10:30:01Z | |
| dc.date.available | 2020-08-14T10:30:01Z | |
| dc.date.issued | 2020 | sv |
| dc.date.submitted | 2020 | |
| dc.description.abstract | We deal with partial differential equations with random data and in particular Poisson’s equation with random data. This equation has a unique solution. The failure probability is the probability that a functional of that solution is less (or greater) than a given value. Algorithms for approximating failure probabilities are studied and tested and a new iterative method of approximating the failure probability is presented and examined in numerical experiments. As the thesis involves both random variables and partial differential equations, both probabilistic problems and problems with partial differential equations are studied along the way. The results of the numerical experiments show that the method performed well, with respect to computational cost, in comparison with a basic Monte Carlo simulation. | sv |
| dc.identifier.coursecode | MVEX03 | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/301466 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | PhysicsChemistryMaths | |
| dc.subject | PDE with random data, failure probability, Monte Carlo method, finite element method, selective refinement | sv |
| dc.title | Computing Failure Probabilities for PDEs with Random Data | sv |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.uppsok | H | |
| local.programme | Engineering mathematics and computational science (MPENM), MSc |