A new algorithm and worst case complexity for Feynman-Kac path integration. (Q5926791): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcph.2000.6599 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033791986 / rank | |||
Normal rank | |||
Revision as of 21:03, 19 March 2024
scientific article; zbMATH DE number 1573089
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm and worst case complexity for Feynman-Kac path integration. |
scientific article; zbMATH DE number 1573089 |
Statements
A new algorithm and worst case complexity for Feynman-Kac path integration. (English)
0 references
2000
0 references
Wiener measure
0 references
multivariate approximation
0 references
