{"title":"Checking approximate computations over the reals","authors":"S. Ar, M. Blum, B. Codenotti, P. Gemmell","doi":"10.1145/167088.167288","DOIUrl":null,"url":null,"abstract":"Checking Approximate Computations over the Reals S. Ar” M. Blumt B. Codenotti$ P. Gemmell~ This paper provides the first systematic investigation of checking approximate numerical computations over subsets of the reals. In most cases, approximate checking is more challenging than exact checking. Problem conditioning, i.e., the measure of sensitivity of the output to slight changes in the input, and the presence of approximate ion parameters foil the direct transformation of many exact checkers to the approximate setting. Furthermore, approximate checking over the reals is complicated by the lack of nice finite field properties such as the existence of a samplable distribution which is invariant under addition or multiplication by a scalar. We overcome the above problems by using such techniques as testing and checking over similar but distinct distributions, using functions’ random and downward self-reducibility properties, and taking advantage of the small variance of the sum of independent identically distributed random variables. We provide approximate checkers for a variety of computations, including matrix multiplication, linear system solution, matrix inversion, and computation of the determinant. We also present an approximate version of Beigel’s trick and extend the approximate linear self tester/corrector of [8] and the trigonometric selftester/corrector of [5] to more general computations. *Department of Computer Science, Princeton University, Princeton, NJ 08544-2087. Supported by NSF PYI grant CCR9057486 and a grant from MITL. t Computer Science Division, UC Berkeley, Berkeley, CA 94720, and International Computer Science Institute, Berkeley CA 94704. Supported by NSF grant CCR88-13632. t International Computer Science Institute, Berkeley, CA 94704, and IEI-CNR, Piss (Italy). Partially supported by the “ Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo”. Subproject 2. e-mail: codenotti@iei.pi .cnr.it ~Computer Science Division, UC Berkeley, Berkeley, CA 94720. Supported by GTE, Schlumberger Fellowships, and by NSF grant CCR88-13632.","PeriodicalId":280602,"journal":{"name":"Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/167088.167288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46
Abstract
Checking Approximate Computations over the Reals S. Ar” M. Blumt B. Codenotti$ P. Gemmell~ This paper provides the first systematic investigation of checking approximate numerical computations over subsets of the reals. In most cases, approximate checking is more challenging than exact checking. Problem conditioning, i.e., the measure of sensitivity of the output to slight changes in the input, and the presence of approximate ion parameters foil the direct transformation of many exact checkers to the approximate setting. Furthermore, approximate checking over the reals is complicated by the lack of nice finite field properties such as the existence of a samplable distribution which is invariant under addition or multiplication by a scalar. We overcome the above problems by using such techniques as testing and checking over similar but distinct distributions, using functions’ random and downward self-reducibility properties, and taking advantage of the small variance of the sum of independent identically distributed random variables. We provide approximate checkers for a variety of computations, including matrix multiplication, linear system solution, matrix inversion, and computation of the determinant. We also present an approximate version of Beigel’s trick and extend the approximate linear self tester/corrector of [8] and the trigonometric selftester/corrector of [5] to more general computations. *Department of Computer Science, Princeton University, Princeton, NJ 08544-2087. Supported by NSF PYI grant CCR9057486 and a grant from MITL. t Computer Science Division, UC Berkeley, Berkeley, CA 94720, and International Computer Science Institute, Berkeley CA 94704. Supported by NSF grant CCR88-13632. t International Computer Science Institute, Berkeley, CA 94704, and IEI-CNR, Piss (Italy). Partially supported by the “ Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo”. Subproject 2. e-mail: codenotti@iei.pi .cnr.it ~Computer Science Division, UC Berkeley, Berkeley, CA 94720. Supported by GTE, Schlumberger Fellowships, and by NSF grant CCR88-13632.
S. Ar " M. Blumt B. Codenotti$ P. Gemmell~本文首次系统地研究了实数子集上的近似数值计算的校核。在大多数情况下,近似检查比精确检查更具挑战性。问题调节,即输出对输入微小变化的灵敏度测量,以及近似离子参数的存在,阻碍了许多精确检查器直接转换为近似设置。此外,由于缺乏良好的有限域性质,例如在标量的加法或乘法下不变的可抽样分布的存在,对实数的近似检查变得复杂。利用函数的随机性和向下自约性,利用独立同分布随机变量和的方差小等技术,克服了上述问题。我们为各种计算提供近似检查器,包括矩阵乘法,线性系统解,矩阵反演和行列式计算。我们还提出了Beigel技巧的近似版本,并将[8]的近似线性自测试仪/校正器和[5]的三角自测试仪/校正器扩展到更一般的计算中。*普林斯顿大学计算机科学系,普林斯顿,新泽西08544-2087。由NSF PYI拨款CCR9057486和MITL资助。t加州大学伯克利分校计算机科学部,加州伯克利,加州94720;国际计算机科学研究所,加州伯克利,加州94704。国家科学基金CCR88-13632资助。1国际计算机科学研究所,伯克利,CA 94704, IEI-CNR, Piss(意大利)。部分由“Progetto Finalizzato Sistemi Informatici和Calcolo Parallelo”支持。子项目2。电邮:codenotti@iei.pi .cnr.it ~加州大学伯克利分校计算机科学部,加州伯克利94720。由GTE、斯伦贝谢奖学金和NSF基金CCR88-13632资助。