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

Author： Baldeaux Jan  

Publisher： Springer Publishing Company

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.59, Iss.3, 2012-03, pp. : 403-431

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

Efficient worst‐case analysis of electronic networks in intervals of frequency

By  

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING: ELECTRONIC NETWORKS, DEVICES AND FIELDS, Vol. 31, Iss. 2, 2018-03 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

The Worst-Case GMRES for Normal Matrices

By Liesen Jörg  

Bit Numerical Mathematics, Vol. 44, Iss. 1, 2004-01 ,pp. : 79-98

Springer Publishing Company

Access to resources Recommend Favorite

Worst and Average Case Roundoff Error Analysis for FFT

By Tasche M.  

Bit Numerical Mathematics, Vol. 41, Iss. 3, 2001-01 ,pp. : 563-581

Springer Publishing Company

Access to resources Recommend Favorite

A Three‐Component Reaction for the Efficient Construction of the 2′,11b′‐Dihydrospiro[indoline‐3,1′‐pyrido[2,1‐a]isoquinoline]

By  

JOURNAL OF HETEROCYCLIC CHEMISTRY, Vol. 52, Iss. 5, 2015-09 ,pp. : 1278-1285

John Wiley & Sons Inc

Access to resources Recommend Favorite

Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces

By Kuo F.Y.  

Journal of Complexity, Vol. 19, Iss. 3, 2003-06 ,pp. : 301-320

Elsevier

Access to resources Recommend Favorite