Expansion and Estimation of the Range of Nonlinear Functions
Abstract: Many verification algorithms use an expansion , for , where the set of matrices is usually computed as a gradient or by means of slopes. In the following, an expansion scheme is described which frequently yields sharper inclusions for . This allows also to compute sharper inclusions for the range of over a domain. Roughly speaking, has to be given by means of a computer program. The process of expanding can then be fully automatized. The function need not be differentiable. For locally convex or concave functions special improvements are described. Moreover, in contrast to other methods, may be empty without implying large overestimations for . This may be advantageous in practical applications.
S. M. Rump
Affiliation: Arbeitsbereich Informatik III, Technische Universität Hamburg-Harburg, D-21071 Hamburg, Germany
Received by editor(s): January 11, 1995
Received by editor(s) in revised form: November 2, 1995
Article copyright: © Copyright 1996 American Mathematical Society