Algorithm for Evaluation of the Interval Power Function of Unconstrained Arguments
Evgueni Petrov

TL;DR
This paper presents an algorithm for accurately evaluating the interval extension of the power function x^y for unconstrained variables, simplifying the problem to cases with non-negative bases to improve computational efficiency.
Contribution
The paper introduces a novel algorithm that reduces the general interval power function evaluation to a simpler case with non-negative bases, enhancing accuracy and efficiency.
Findings
Effective reduction of the general case to non-negative bases
Improved accuracy in interval power function evaluation
Potential for application in interval arithmetic computations
Abstract
We describe an algorithm for evaluation of the interval extension of the power function of variables x and y given by the expression x^y. Our algorithm reduces the general case to the case of non-negative bases.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Polynomial and algebraic computation · Logic, programming, and type systems
