arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.21365math.OC
收藏

一种具有拟多项式复杂度的截断立方体体积近似确定性算法

A Deterministic Algorithm of Quasi-Polynomial Complexity for Clipped Cubes Volume Approximation

Marius Costandin

AI总结:

本文提出了一种具有拟多项式复杂度的确定性算法,用于近似计算单位超立方体与特定集合(如半空间、球体和椭球体)交集的体积,并给出了详细的收敛性与复杂度分析。

摘要:

我们提出了一种具有拟多项式复杂度的确定性方法,用于近似计算单位超立方体与两个特定集合的交集的体积。该方法实际上可应用于(在不失去拟多项式复杂度的前提下)计算超立方体与固定数量集合的交集体积,这些集合由形如 $\sum_{q=1}^n a_q(x_q) \leq b$ 的方程描述,其中 $a_q : \mathbb{R} \to \mathbb{R}$ 是多项式函数,$b \in \mathbb{R}$。注意,所得集合不一定是凸的。此类方程除其他外,还描述了半空间、球体和椭球体。我们针对单位超立方体被任意半径的球体截断的情况给出了详细的收敛性和复杂度分析,但这些球体的中心到单位超立方体的距离大于 1。

英文摘要:

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to compute the volume of the hypercube intersected with a fixed number of sets, described by equations of the form $\sum_{q=1}^n a_q(x_q) \leq b$, where $a_q : \mathbb{R} \to \mathbb{R}$ are polynomial functions and $b \in \mathbb{R}$. Note that the resulting sets are not necessarily convex. This type of equations describe, among others, half-spaces, balls and ellipsoids. We give detailed convergence and complexity analysis for the case in which the unit hypercube is clipped by balls of arbitrary radius but with centers whom distance to the unit hypercube is greater than $1$ (one).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑