Rump, Siegfried M.Siegfried M.Rump2021-05-062021-05-061996Mathematics of Computation 65 (216): 1503-1512 (1996)http://hdl.handle.net/11420/9457Many verification algorithms use an expansion f(x) ∈ f(x̃) + S · (x-x̃), f : ℝ → ℝ for x ∈ X, where the set of matrices S if usually computed as a gradient or by means of slopes. In the following, an expansion scheme is described which frequently yields sharper inclusions for S. This allows also to compute sharper inclusions for the range of f over a domain. Roughly speaking, f has to be given by means of a computer program. The process of expanding f can then be fully automatized. The function f need not be differentiable. For locally convex or concave functions special improvements are described. Moreover, in contrast to other methods, x̃ ∩ X may be empty without implying large overestimations for S. This may be advantageous in practical applications. n nen1088-6842199621615031512InformatikMathematikJournal Article10.1090/S0025-5718-96-00773-9Other