Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

MOC
2002

favoriteEmaildiscussreport

86views more MOC 2002»

On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weight

13 years 4 months ago

On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weight

Download www.ams.org

We develop and justify an algorithm for the construction of quasi

Ian H. Sloan, Frances Y. Kuo, Stephen Joe

Real-time Traffic

Lattice Rule | MOC 2002 | Rank-1 Lattice Rules | Sobolev Spaces |

claim paper

Related Content

» The error bounds and tractability of quasiMonte Carlo algorithms in infinite dimension

» Randomly shifted lattice rules for unbounded integrands

» Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimension...

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	MOC
Authors	Ian H. Sloan, Frances Y. Kuo, Stephen Joe

Comments (0)