Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials

Author: Novak E.  

Publisher: Academic Press

ISSN: 0885-064X

Source: Journal of Complexity, Vol.15, Iss.3, 1999-09, pp. : 299-316

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

Lower bounds for the error of quadrature formulas with positive weights are proved. We get intractability results for quasi-Monte Carlo methods and, more generally, for positive formulas. We consider general classes of functions but concentrate on lower bounds for relatively small classes of trigonometric polynomials. We also conjecture that similar lower bounds hold for arbitrary quadrature formulas and state different equivalent conjectures concerning positive definiteness of certain matrices and certain extremal problems for trigonometric polynomials. We also study classes of functions with weighted norms where some variables are “more important” than others. Positive quadrature formulas are then tractable iff the sum of the weights is bounded. Copyright 1999 Academic Press.