|
Volumn 164, Issue 2, 2000, Pages 335-353
|
A new algorithm and worst case complexity for Feynman-Kac path integration
a b a,c |
Author keywords
Feynman Kac path integration; Multivariate approximation; Wiener measure; Worst case complexity
|
Indexed keywords
APPROXIMATION ALGORITHMS;
INTEGRAL EQUATIONS;
INTEGRATION;
QUANTUM THEORY;
FEYNMAN-KAC PATH INTEGRATION;
FINITE NUMBER;
INITIAL CONDITIONS;
MULTIVARIATE APPROXIMATIONS;
NUMBER OF SAMPLES;
PATH INTEGRAL;
PATH INTEGRATION;
PRE-COMPUTATION;
WIENER MEASURE;
WORST-CASE COMPLEXITY;
COMPUTATIONAL COMPLEXITY;
|
EID: 0006726071
PISSN: 00219991
EISSN: None
Source Type: Journal
DOI: 10.1006/jcph.2000.6599 Document Type: Article |
Times cited : (25)
|
References (21)
|