A Simple, Bias-free Approximation of Covariance Functions by the Multilevel Monte Carlo Method Having Nearly Optimal Complexity
From MaRDI portal
Publication:6062233
Cites work
- Approximation of probability density functions by the multilevel Monte Carlo maximum entropy method
- Approximation theory in tensor product spaces
- Combination technique based k-th moment analysis of elliptic problems with random diffusion
- Convergence analysis of multilevel Monte Carlo variance estimators and application for random obstacle problems
- Estimation of arbitrary order central statistical moments by the multilevel Monte Carlo method
- Higher moments of Banach space valued random variables
- scientific article; zbMATH DE number 1716480 (Why is no real title available?)
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 2000348 (Why is no real title available?)
- Isogeometric analysis of diffusion problems on random surfaces
- Karhunen-Loève approximation of random fields by generalized fast multipole methods
- Multi-level Monte Carlo finite element method for elliptic PDEs with stochastic coefficients
- Multilevel ensemble Kalman filtering for spatio-temporal processes
- Multilevel Monte Carlo methods and applications to elliptic PDEs with random coefficients
- Multilevel Monte Carlo Path Simulation
- On the construction of sparse tensor product spaces
- On the convergence of the combination technique
- Quantifying uncertain system outputs via the multilevel Monte Carlo method. I: Central moment estimation
- Sparse tensor discretization of elliptic SPDEs
- Tensor spaces and numerical tensor calculus
Cited in
(3)
This page was built for publication: A Simple, Bias-free Approximation of Covariance Functions by the Multilevel Monte Carlo Method Having Nearly Optimal Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062233)