Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alefeld, G.: Inclusion methods for systems of nonlinear equations—the interval Newton method and modifications. In: Herzberger, J. (ed.) Topics in Validated Computations. Elsevier, Amsterdam (1994)
Comba, J.L.D., Stolfi, J.: Affine arithmetic and its applications to computer graphics. In: Proc. SIBGRAPI’93–VI Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens (Recife, BR), pp. 9–18 (1993)
de Figueiredo, L.H., Stolfi, J.: Adaptive enumeration of implicit surfaces with affine arithmetic. Comput. Graph. Forum 15, 287–296 (1996)
de Figueiredo, L.H., Stolfi, J.: Self-validated numerical methods and applications. In: Brazilian Mathematics Colloquium Monograph, IMPA. Rio de Janeiro, Brazil (1997)
de Figueiredo, L.H., Stolfi, J.: An introduction to affine arithmetic. TEMA Tend. Mat. Apl. Comput. 4(3), 297–312 (2003)
de Figueiredo, L.H., Stolfi, J.: Affine arithmetic: concepts and applications. Numer. Algorithms 37(1–4), 147–158 (2004)
Kolev, L.V.: Optimal multiplication of G-intervals. Reliab. Comput. 13, 399–408 (2007)
Kolev, L.V.: A new method for global solution of systems of nonlinear equations. Reliab. Comput. 4(1), 1–21 (1998)
Zhang, Q., Martin, R.R.: Polynomial evaluation using affine arithmetic for curve drawing. In: Proc. Eurographics UK 2000 Conf., pp. 49–56. Eurographics UK, Abingdon (2000)
Martin, R.R., Shou, H., Voiculescu, I., Bowyer, A., Wang, G.: Comparison of interval methods for plotting algebraic curves. Comput. Aided Geom. Des. 19(7), 553–587 (2002)
Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)
http://extreme.adorio-research.org/download/mvf/html/node3.html. Accessed August 2011
http://www.mat.univie.ac.at/ neum/glopt/moretest/. Accessed August 2011
http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO_files/Page364.htm. . Accessed August 2011
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Skalna, I. Algorithm for min-range multiplication of affine forms. Numer Algor 63, 601–614 (2013). https://doi.org/10.1007/s11075-012-9644-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-012-9644-0