Universal optimality of digital nets and lattice designs

DOI10.1007/S11425-009-0171-YzbMath1178.62080OpenAlexW2127735632MaRDI QIDQ1047870

Fred J. Hickernell, Ming-Yao Ai

Publication date: 6 January 2010

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-009-0171-y

zbMATH Keywords

Chebyshev polynomialstrigonometric functions

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Optimal statistical designs (62K05) Statistical block designs (62K10) Factorial statistical designs (62K15)

Related Items (1)

Balanced incomplete Latin square designs

Cites Work

• Majorization and the Lorenz order: a brief introduction
• Efficient \(D_ s\)-optimal designs for multivariate polynomial regression on the q-cube
• Optimal designs for large degree polynomial regression
• Lattice-based \(D\)-optimum design for Fourier regression
• Optimum Designs in Regression Problems
• Universal optimality of experimental designs: Definitions and a criterion
• Inequalities: theory of majorization and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal optimality of digital nets and lattice designs