Full Length ArticleOn alternative quantization for doubly weighted approximation and integration over unbounded domains
Introduction
In various applications, continuous objects (signals, images, etc.) are represented (or approximated) by discrete counterparts. That is, we deal with quantization. From a pure mathematics point of view, quantization often leads to approximating functions from a given space by step functions or, more generally, by piecewise polynomials of certain degree. Then it is important to know which quantizer should be used, or how to select break points (knots) to make the error of approximation as small as possible.
It is well known that for approximation on a compact interval in the space of real-valued functions such that are absolutely continuous and , the choice of an optimal quantizer is not a big issue, since equidistant knots lead to approximations with optimal error where depends only on , , and , and where , see, e.g., [5]. The problem becomes more complicated if we switch to weighted approximation on unbounded domains. A generalization of (1) to this case was given in [6], and it reads as follows. Assume for simplicity that the domain . Let be two a.e. positive and integrable weight functions. For a positive integer and , consider the -weighted approximation in the linear space of functions with locally absolutely continuous st derivative and such that the -weighted norm of is finite, i.e., . Note that the spaces have been introduced in [8], and the role of is to moderate their size.
Denote and suppose that and are nonincreasing4 on , and that It was shown in [6, Theorem 1] that then one can construct approximations using knots with -weighted error at most where the factor is given in (10). This means that if (3) holds true, then the upper bound on the worst-case error is proportional to . The convergence rate is optimal and a corresponding lower bound implies that if (3) is not satisfied then the rate cannot be reached (see [6, Theorem 3]).
The optimal knots are determined by quantiles of , to be more precise, In order to use the optimal quantizer (5) one has to know ; otherwise one has to rely on some approximations of . Moreover, even if is known, it may be a complicated function and therefore difficult to handle computationally. Driven by this motivation, the purpose of the present paper is to generalize the results of [6] even further to see how the quality of best approximations will change if the optimal quantizer is replaced in (5) by another quantizer .
A general answer to the aforementioned question is given in Theorem 1, Theorem 3 of Section 2. We show, respectively, tight (up to a constant) upper and lower bounds for the error when a quantizer with instead of is used to determine the knots. To be more specific, define and (Note that (6), (7) are consistent since .) If then the best achievable error is proportional to This means, in particular, that for the error to behave as it is sufficient (but not necessary) that decreases no faster than as . For instance, if the optimal quantizer is Gaussian, , then the optimal rate is still preserved if its exponential substitute with arbitrary is used. It also shows that, in case is not exactly known, it is much safer to overestimate than to underestimate it, see also Example 5.
The use of a quantizer as above results in approximations whose errors are worse than those for the optimal approximations by the factor of In Section 3, we calculate the exact values of this factor for various combinations of weights , , and , including: Gaussian, exponential, log-normal, logistic, and -Student. It turns out that in many cases is quite small, so that the loss in accuracy of approximation is well compensated by simplification of the quantizer.
The results for are also applicable to the problem of approximating the -weighted integral for functions , see Remark 6, Remark 7. In this case, the best possible convergence rate is and it can be achieved if and only if (3) holds with . These results are especially important for unbounded domains, e.g., or . For such domains, the integrals are often approximated by Gauss–Laguerre rules and Gauss–Hermite rules, respectively, see, e.g., [1], [3], [7]; however, their efficiency requires infinitely smooth integrands and the results are asymptotic. Moreover, it is not clear which Gaussian rules should be used when is not a constant function. But, even for , it is likely that the worst-case errors (with respect to ) of Gaussian rules are much larger than , since the Weierstrass theorem holds only for compact . An extension of Gaussian rules to functions with singularities has been proposed in [2]. However, the results of [2] are also asymptotic and it is not clear how the proposed rules behave for functions from spaces . In the present paper, we deal with functions of bounded smoothness () and provide worst-case error bounds that are minimal. We stress here that the regularity degree is a fixed but arbitrary positive integer. The paper [4] proposes a different approach to the weighted integration over unbounded domains; however, it is restricted to regularity only.
The paper is organized as follows. In the following section, we present ideas and results about alternative quantizers. The main results are Theorem 1, Theorem 3. In Section 3, we apply our results to some specific cases for which numerical values of are calculated.
Section snippets
Optimal versus alternative quantizers
We consider -weighted approximation in the space as defined in the introduction. Although the results of this paper pertain to domains being an arbitrary interval, to begin with we assume that We will explain later what happens in the general case including .
Let the knots be determined by a nonincreasing function (quantizer) satisfying , i.e.,
Let be a piecewise Taylor approximation of
Special cases
Below we apply our results to specific weights , and specific values of and .
Acknowledgments
The authors would like to thank two anonymous reviewers for their helpful comments.
References (8)
- et al.
Optimal algorithms for doubly weighted approximation of univariate functions
J. Approx. Theory
(2016) - et al.
Complexity of weighted approximation over
J. Approx. Theory
(2000) - et al.
Methods of Numerical Integration
(1984) - et al.
Dimension-adaptive sparse grid quadrature for integrals with boundary singularities
Cited by (0)
- 1
P. Kritzer is supported by the Austrian Science Fund (FWF): Project F5506-N26, which is a part of the Special Research Program ”Quasi-Monte Carlo Methods: Theory and Applications”.
- 2
F. Pillichshammer is supported by the Austrian Science Fund (FWF): Project F5509-N26, which is a part of the Special Research Program ”Quasi-Monte Carlo Methods: Theory and Applications”.
- 3
L. Plaskota is supported by the National Science Centre, Poland : Project 2017/25/B/ST1/00945.