Algorithm for min-range multiplication of affine forms
An efficient method is presented for computing the minimum range (min-range) affine approximation of the product of arbitrary affine forms that do not contain the zero properly. 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. Nonlinear operators, such as multiplication, must be approximated by affine forms. Thus, the selection of an appropriate approximation is a big challenge, since different approximations may be more accurate for specific purposes. Four numerical experiments are carried out to demonstrate the essential features of the proposed approach, especially its usefulness for bounding ranges of functions for global optimization and for finding roots of functions.
- A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms
- Extensions of affine arithmetic: application to unconstrained global optimization
- An Introduction to Affine Arithmetic
- New formulae for multiplication of intervals
- A general reliable quadratic form: An extension of affine arithmetic
- Affine arithmetic: concepts and applications
- An Introduction to Affine Arithmetic
- Comparison of interval methods for plotting algebraic curves
- scientific article; zbMATH DE number 714513 (Why is no real title available?)
- scientific article; zbMATH DE number 1408651 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Optimal multiplication of \(G\)-intervals
This page was built for publication: Algorithm for min-range multiplication of affine forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391826)