On the complexity of parabolic initial-value problems with variable drift
DOI10.1016/J.JCO.2005.07.005zbMATH Open1098.65098OpenAlexW2138639406MaRDI QIDQ2489153FDOQ2489153
Authors: Knut Petras, Klaus Ritter
Publication date: 16 May 2006
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2005/149/
Recommendations
- Complexity of parametric initial value problems in Banach spaces
- The randomized complexity of initial value problems
- A probabilistic numerical solution method for initial value problems of parabolic equations
- Linear complexity solution of parabolic integro-differential equations
- Complexity of initial value problems in Banach spaces
error boundscomplexityMonte Carlo methodOptimal algorithmVariance reductionWorst case analysisVariable coefficientsParabolic initial value problemSmolyak formula
Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20) Initial value problems for second-order parabolic equations (35K15) Error bounds for initial value and initial-boundary value problems involving PDEs (65M15) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70)
Cites Work
- Title not available (Why is that?)
- A survey of numerical methods for stochastic differential equations
- Characterization of the law of the iterated logarithm in Banach spaces
- Deterministic and stochastic error bounds in numerical analysis
- Title not available (Why is that?)
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Parabolic differential equations with unbounded coefficients -- A generalization of the parametrix method
- Complexity of weighted approximation over \(\mathbb{R}^d\)
- A new algorithm and worst case complexity for Feynman-Kac path integration.
- Applicability of Smolyak's algorithms to certain Banach spaces of multivariate functions.
- The real number model in numerical analysis
- Worst case complexity of multivariate Feynman--Kac path integration
- An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals
Cited In (7)
- On the complexity of parametric ODEs and related problems
- On sub-polynomial lower error bounds for quadrature of SDEs with bounded smooth coefficients
- What is the Complexity of Related Elliptic, Parabolic, and Hyperbolic Problems?
- On the complexity of computing quadrature formulas for marginal distributions of SDEs
- Constructive Quantization and Multilevel Algorithms for Quadrature of Stochastic Differential Equations
- Derandomization of the Euler scheme for scalar stochastic differential equations
- The randomized information complexity of elliptic PDE
This page was built for publication: On the complexity of parabolic initial-value problems with variable drift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489153)