Lifting the Curse of Dimensionality
暂无分享,去创建一个
[1] Harald Niederreiter,et al. Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.
[2] Sean R Eddy,et al. What is dynamic programming? , 2004, Nature Biotechnology.
[3] H. Bungartz,et al. Sparse grids , 2004, Acta Numerica.
[4] I. H. SLOAN,et al. Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces , 2002, SIAM J. Numer. Anal..
[5] E. Novak,et al. Foundations of Computational Mathematics: When are integration and discrepancy tractable? , 2001 .
[6] H. Woxniakowski. Information-Based Complexity , 1988 .
[7] Henryk Wozniakowski,et al. When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals? , 1998, J. Complex..
[8] I. Sloan. Lattice Methods for Multiple Integration , 1994 .