用阶跃函数逼近$L_\infty$的算法
An Algorithm for $L_\infty$ Approximation by Step Functions
摘要:
给出了一种算法,用于确定加权数据的最佳$b$ -步近似,其中误差相对于$L_\infty$范数进行测量。对于由自变量预排序的数据,该算法需要$Θ(n + \log n \cdot b(1+\log n/b))$时间和$Θ(n)$空间。最差情况下为$Θ(n \log n)$,$b = O(n/\log n \log\log n)$时为$Θ(n)$。在相同的时间和空间范围内,一个微小的变化决定了最佳的减少保序回归,该算法还解决了$k$中心问题的1维加权数据。
英文摘要:
An algorithm is given for determining an optimal $b$-step approximation of weighted data, where the error is measured with respect to the $L_\infty$ norm. For data presorted by the independent variable the algorithm takes $Θ(n + \log n \cdot b(1+\log n/b))$ time and $Θ(n)$ space. This is $Θ(n \log n)$ in the worst case and $Θ(n)$ when $b = O(n/\log n \log\log n)$. A minor change determines an optimal reduced isotonic regression in the same time and space bounds, and the algorithm also solves the $k$-center problem for 1-dimensional weighted data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。