Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules

Baldeaux, J Dick, J

Leobacher, G

Nuyens, D

Pillichshammer, F

Permalink

Closed Access

	Filename	Description	Size
	2011000273OK.pdf		651.08 kB	Adobe PDF	View/Open

Copyright Clearance Process

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Baldeaux, J	en_US
dc.contributor.author	Dick, J https://orcid.org/0000-0003-0142-6022	en_US
dc.contributor.author	Leobacher, G https://orcid.org/0000-0002-7837-784X	en_US
dc.contributor.author	Nuyens, D https://orcid.org/0000-0002-4555-2314	en_US
dc.contributor.author	Pillichshammer, F https://orcid.org/0000-0001-6952-9218	en_US
dc.date.issued	2012-03-01	en_US
dc.identifier.citation	NUMERICAL ALGORITHMS, 2012, 59 (3), pp. 403 - 431 (29)	en_US
dc.identifier.issn	1017-1398	en_US
dc.identifier.uri	http://hdl.handle.net/10453/18887
dc.language	English	en_US
dc.publisher	SPRINGER	en_US
dc.relation.ispartof	NUMERICAL ALGORITHMS	en_US
dc.relation.isbasedon	10.1007/s11075-011-9497-y	en_US
dc.subject.classification	Numerical & Computational Mathematics	en_US
dc.title	Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	59	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Business
utslib.copyright.status	closed_access
pubs.issue	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	59	en_US

Please use this identifier to cite or link to this item: