This all-in-one code computes the sparse Clenshaw-Curtis grid points and weights for an orthotope of arbitrary dimensionality. i.e. It's for integrating a high-dimensional function in a box domain. This is not an adaptive code.
Greg von Winckel (2019). Sparse grid quadrature (https://www.mathworks.com/matlabcentral/fileexchange/19063-sparse-grid-quadrature), MATLAB Central File Exchange. Retrieved .
This is an excellent work. However, after verifying this code using a group of test cases, I found that the results for most the test cases are not correct when compared with those derived by Maple. Does anyone has the same problem with me?
computation result is not accurate, for example, test example use triplequad in matlab.
It's quite helpful to me. Thx
I also hope to know how to extend the code using other quadrature rules like Gauss-Hermite and Gauss-laguerre quadratures.