An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals
From MaRDI portal
Recommendations
- Worst case complexity of multivariate Feynman--Kac path integration
- A new algorithm and worst case complexity for Feynman-Kac path integration.
- A Monte Carlo method for integration of multivariate smooth functions
- scientific article; zbMATH DE number 822302
- scientific article; zbMATH DE number 953025
Cites work
- A new algorithm and worst case complexity for Feynman-Kac path integration.
- Approximation of Wiener integrals
- Deterministic and stochastic error bounds in numerical analysis
- Explicit cost bounds of algorithms for multivariate tensor product problems
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 1246413 (Why is no real title available?)
- Multidimensional Spline Approximation
- Spline approximation by quasiinterpolants
- Worst case complexity of multivariate Feynman--Kac path integration
Cited in
(6)- An efficient backward Monte Carlo estimator for solving a quantum-kinetic equation with memory kernel
- Worst case complexity of multivariate Feynman--Kac path integration
- On the complexity of parabolic initial-value problems with variable drift
- The Feynman path goes Monte Carlo
- Forward-walking Green's Function Monte Carlo Method for Correlation Functions
- A new algorithm and worst case complexity for Feynman-Kac path integration.
This page was built for publication: An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438649)