A Numerical Comparison Between Quasi-Monte Carlo and Sparse Grid Stochastic Collocation Methods

E-ISSN： 1991-7120|12|4|1051-1069

ISSN： 1815-2406

Source： Communications in Computational Physics, Vol.12, Iss.4, 2012-10, pp. : 1051-1069

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

CORRECTION TO “QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND”

ANZIAM Journal, Vol. 54, Iss. 3, 2013-01 ,pp. : 216-219

Cambridge University Press

Access to resources Recommend Favorite

QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND

ANZIAM Journal, Vol. 53, Iss. 1, 2012-05 ,pp. : 1-37

Cambridge University Press

Access to resources Recommend Favorite

CORRECTION TO “QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND”

ANZIAM Journal, Vol. 53, Iss. 3, 2012-01 ,pp. : 251-251

Cambridge University Press

Access to resources Recommend Favorite

Sparse Grid Collocation Method for an Optimal Control Problem Involving a Stochastic Partial Differential Equation with Random Inputs

East Asian Journal on Applied Mathematics, Vol. 4, Iss. 2, 2014-05 ,pp. : 166-188

Cambridge University Press

Access to resources Recommend Favorite

The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital nets

By Cristea Ligia Dick Josef Leobacher Gunther Pillichshammer Friedrich

Numerische Mathematik, Vol. 105, Iss. 3, 2007-01 ,pp. : 413-455

Springer Publishing Company

Access to resources Recommend Favorite