Interval arithmetic, affine arithmetic, Taylor series methods: Why, what next?
The authors consider \(N\)-dimensional families of functions of the type \[ \{C_1F_1(x_1,\dots,x_n)+\dots+C_NF_N(x_1,\dots,x_n) \mid C_1,\dots,C_N\in \mathbb{R}\}, \] where \(F_1,\dots,F_N\) are analytic functions. Assuming that a transitive relation \(\succeq\) on the set of all \(N\)-dimensional families is given, they call the relation final if there exists exactly one \(N\)-dimensional family \(\Phi\) satisfying \(\Phi\succeq\Psi\) for each \(\Psi\). The main result given in the paper says that if \(\succeq\) is a final rescaling-invariant relation on the set of all families, then each function from the optimal family \(\Phi\) is a polynomial. Consequences of this result for interval computations are discussed.
- Interval Taylor forms
- Sharpness in interval computations
- Horner's rule for interval evaluation revisited
- About tracing problems in dynamic geometry
- An interval algorithm for uncertain dynamic stability analysis
- Optimal centers in branch-and-prune algorithms for univariate global optimization
- Improved convex and concave relaxations of composite bilinear forms
- Robust set-membership parameter estimation of the glucose minimal model
- A survey of methods for the estimation ranges of functions using interval arithmetic
- Status of the differential transformation method
- scientific article; zbMATH DE number 1507559 (Why is no real title available?)
- scientific article; zbMATH DE number 845653 (Why is no real title available?)
- Polar affine arithmetic: optimal affine approximation and operation development for computation in polar form under uncertainty
- A fast diagonalization algorithm to enable singular value decomposition of large matrices for efficient template matching
This page was built for publication: Interval arithmetic, affine arithmetic, Taylor series methods: Why, what next?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387779)
