Numerical Algorithms

, Volume 63, Issue 4, pp 601–614

Algorithm for min-range multiplication of affine forms

Open AccessOriginal Paper

DOI: 10.1007/s11075-012-9644-0

Cite this article as:
Skalna, I. Numer Algor (2013) 63: 601. doi:10.1007/s11075-012-9644-0


Affine arithmetic produces guaranteed enclosures for computed quantities, taking into account any uncertainties in the input data as well as round-off errors. Elementary operations on affine forms are redefined so they result in affine forms. Affine-linear operations result straightforwardly in affine forms. Non-linear operators, such as multiplication, must be approximated by affine forms. Choosing the appropriate approximation is a big challenge. The reason is that different approximations may be more accurate for specific purposes. This paper presents an efficient method for computing the minimum range (min-range) affine approximation of the product of arbitrary affine forms that do not contain zero properly. Numerical experiments are carried out to demonstrate the essential features of the proposed approach, especially its usefulness for bounding ranges of functions for global optimisation and for finding roots of functions.


Affine arithmeticMultiplicationMin-range approximationRange boundingGlobal optimisationRoots of functions
Download to read the full article text

Copyright information

© The Author(s) 2012

Authors and Affiliations

  1. 1.AGH University of Science and TechnologyKrakowPoland