Abstract
Given a nonempty set of functions
where a = x 0 < ... < x n = b are known nodes and w i , i = 0,...,n, d i , i = 1,..., n, known compact intervals, the main aim of the present paper is to show that the functions \(\underline f :x \mapsto \min \{ f(x):f \in F\} ,{\text{ }}x \in [a,b],\) and
exist, are in F, and are easily computable. This is achieved essentially by giving simple formulas for computing two vectors \(\tilde l,\tilde u \in \mathbb{R}^{n + 1}\) with the properties
\(\tilde l,\tilde u\)] is the interval hull of (the tolerance polyhedron) T; • \({\tilde l}\) ≤ ū iff T ≠ 0 iff F ≠ 0. \(\underline f ,\overline f\), can serve for solving the following problem: Assume that μ is a monotonically increasing functional on the set of Lipschitz-continuous functions f : [a,b] → R (e.g. μ(f) = ∫ a b f(x) dx or μ(f) = min f([a,b]) or μ(f) = max f([a,b])), and that the available information about a function g : [a,b] → R is "g ∈ F," then the problem is to find the best possible interval inclusion of μ(g). Obviously, this inclusion is given by the interval [μ(\(\underline f\),μ(\(\overline f\))]. Complete formulas for computing this interval are given for the case μ(f) = ∫ a b f(x) dx.
Similar content being viewed by others
References
Hammer, R., Hocks, M., Kulisch, U., and Ratz, D.: Numerical Toolbox for Verified Computing I-Basic Numerical Problems, Springer, Berlin, 1993.
Heindl, G.: Zur Einschließung der Werte von Peanofunktionalen, Z. angew. Math. Mech. 75(II) (1995), pp. 637–638.
Jansson, C.: Construction of Convex Lower and Concave Upper Bound Functions, Bericht 98.1 des Forschungsschwerpunktes Informations-und Kommunikationstechnik der Technischen Universität Hamburg-Harburg, März, 1998.
Klatte, R., Kulisch, U., Neaga, M., Ratz, D., and Ullrich, C.P.: PASCAL-XSC Language Reference with Examples, Springer, Berlin, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Heindl, G. A Representation of the Interval Hull of a Tolerance Polyhedron Describing Inclusions of Function Values and Slopes. Reliable Computing 5, 269–278 (1999). https://doi.org/10.1023/A:1009928406426
Issue Date:
DOI: https://doi.org/10.1023/A:1009928406426