ترغب بنشر مسار تعليمي؟ اضغط هنا

A Sequential Approach to the Henstock Integral

69   0   0.0 ( 0 )
 نشر من قبل Laramie Paxton
 تاريخ النشر 2016
  مجال البحث
والبحث باللغة English
 تأليف Laramie Paxton




اسأل ChatGPT حول البحث

The theory of integration over R is rich with techniques as well as necessary and sufficient conditions under which integration can be performed. Of the many different types of integrals that have been developed since the days of Newton and Leibniz, one relative newcomer is that of the Henstock integral, aka the Henstock-Kurzweil integral, Generalized Riemann integral, or gauge integral, which was discovered independently by Henstock and Kurzweil in the mid-1950s. In this paper, we develop an alternative, sequential definition of the Henstock integral over closed intervals in R that we denote as the Sequential Henstock integral. We show its equivalence to the standard epsilon-delta definition of the Henstock integral as well as to the Darboux definition and to a topological definition of the Henstock integral. We then establish the basic properties and fundamental theorems, including two convergence theorems, for the Sequential Henstock integral and offer suggestions for further study.



قيم البحث

اقرأ أيضاً

89 - Hana Bendova , Jan Maly 2010
We give an alternative definition of integral at the generality of the Perron integral and propose an exposition of the foundations of integral theory starting from this new definition. Both definition and proofs needed for the development are unexpe ctedly simple. We show how to adapt the definition to cover the multidimensional and Stieltjes case and prove that our integral is equivalent to the Henstock-Kurzweil(-Stieltjes) integral.
We present a general approach to sparse domination based on single-scale $L^p$-improving as a key property. The results are formulated in the setting of metric spaces of homogeneous type and avoid completely the use of dyadic-probabilistic techniques as well as of Christ-Hytonen-Kairema cubes. Among the applications of our general principle, we recover sparse domination of Dini-continuous Calderon-Zygmund kernels on spaces of homogeneous type, we prove a family of sparse bounds for maximal functions associated to convolutions with measures exhibiting Fourier decay, and we deduce sparse estimates for Radon transforms along polynomial submanifolds of $mathbb R^n$.
The basic properties of the Daniell integral are presented. We do not use the standard approach of introducing auxiliary spaces of the over-functions and under-functions. Instead, we use a simple and direct approach based on approximating integrable functions by absolutely convergent series of simple functions.
In this paper we provide a unified approach to a family of integrals of Mellin--Barnes type using distribution theory and Fourier transforms. Interesting features arise in many of the cases which call for the application of pull-backs of distributi ons via smooth submersive maps defined by Hormander. We derive by this method the integrals of Hecke and Sonine relating to various types of Bessel functions which have found applications in analytic and algebraic number theory.
We propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is fou nd by using a sparsity inducing empirical risk, which is a relaxation of the standard L 0 regularized risk. The classification problem is modeled as a sequential decision process that sequentially chooses, for each datapoint, which features to use before classifying. Datum-Wise Classification extends naturally to multi-class tasks, and we describe a specific case where our inference has equivalent complexity to a traditional linear classifier, while still using a variable number of features. We compare our classifier to classical L 1 regularized linear models (L 1-SVM and LARS) on a set of common binary and multi-class datasets and show that for an equal average number of features used we can get improved performance using our method.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا