A Note on Tchakaloff’s Theorem

نویسندگان

  • MIHAI PUTINAR
  • Palle E. T. Jorgensen
چکیده

A classical result of Tchakaloff on the existence of exact quadrature formulae up to a given degree is extended to positive measures without compact support. A criterion for the existence of Gaussian quadratures for a class of such measures is also derived from the main proof.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compressed sampling inequalities by Tchakaloff’s theorem

We show that a discrete version of Tchakaloff’s theorem on the existence of positive algebraic cubature formulas, entails that the information required for multivariate polynomial approximation can be suitably compressed. 2000 AMS subject classification: 41A10, 65D32.

متن کامل

The Proof of Tchakaloff’s Theorem

We provide a simple proof of Tchakaloff’s Theorem on the existence of cubature formulas of degree m for Borel measures with moments up to order m. The result improves known results for non-compact support, since we do not need conditions on (m + 1)st moments. We consider the question of existence of cubature formulas of degree m for Borel measures μ, where moments up to order m exist: Definitio...

متن کامل

A note on spectral mapping theorem

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

متن کامل

Generalized Tchakaloff’s Theorem for Semi-spectral Measures

We proved the existence of exact quadrature formulae with semipositive definite coefficient matrices for polynomials of prescribed degree in n variables and with respect to a semi-spectral measure. Our proof could be viewed as a direct translation (generalization) of Putinar’s result on the existence of quadrature formulae for a positive measure without compact support.

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997