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

精确浮点计算的复杂性

The complexity of accurate floating point computation

James Demmel

AI总结:

本文研究在严格准确性(相对误差小于1)和多项式时间效率要求下,计算浮点有理表达式及矩阵分解(如LU和SVD)的算法存在性与复杂性。

摘要:

我们的目标是,在存在的情况下,找到准确且高效的算法,用于计算包含浮点数的有理表达式,以及计算以有理表达式为元素的矩阵的矩阵分解(如LU分解和奇异值分解)。更精确地说,{\em 准确性}意味着输出的相对误差必须小于1(无论输出多么微小),而{\em 效率}意味着算法在多项式时间内运行。我们的目标具有挑战性,因为我们的准确性要求比通常严格得多。

英文摘要:

Our goal is to find accurate and efficient algorithms, when they exist, for evaluating rational expressions containing floating point numbers, and for computing matrix factorizations (like LU and the SVD) of matrices with rational expressions as entries. More precisely, {\em accuracy} means the relative error in the output must be less than one (no matter how tiny the output is), and {\em efficiency} means that the algorithm runs in polynomial time. Our goal is challenging because our accuracy demand is much stricter than usual.

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

↑