Nonparametric density estimation for randomly perturbed elliptic problems III: convergence, computational cost, and generalizations
- First Online:
- 75 Downloads
This is the third in a series of three papers on nonparametric density estimation for randomly perturbed elliptic problems. In the previous papers by Estep, Målqvist, and Tavener (SIAM J. Sci. Comput. 31:2935–2959, 2009; Int. J. Numer. Methods Eng. 80:846–867, 2009), we derive an a posteriori error estimate for a computed probability distribution and an efficient adaptive algorithm for propagation of uncertainty into a quantity of interest computed from numerical solutions of an elliptic partial differential equation. We also test the algorithm on various problems including an example relevant to oil reservoir simulation. In this paper, we derive a convergence result for the method based on the assumption that the underlying domain decomposition algorithm converges geometrically. The main ideas of the proof can be applied to a large class of domain decomposition algorithms. We also present several generalizations of the method and an analysis of the computational cost.
KeywordsA posteriori error analysis Domain decomposition Convergence Elliptic problem Neumann series Nonparametric density estimation Random perturbation Forward sensitivity analysis
Mathematics Subject Classification (2000)65N15 65N30 65N55 65C05
Unable to display preview. Download preview PDF.