Reliable Computing最新文献

Dear colleagues 亲爱的同事们

Reliable Computing Pub Date : 2021-12-04 DOI: 10.1007/BF02384049

V. Nesterov

引用次数: 0

A Rigorous Extension of the Schönhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic 用复区间算法对Schönhage-Strassen整数乘法算法的严格扩展

Reliable Computing Pub Date : 2010-06-01 DOI: 10.4204/EPTCS.24.19

R. Sainudiin, T. Steinke

{"title":"A Rigorous Extension of the Schönhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic","authors":"R. Sainudiin, T. Steinke","doi":"10.4204/EPTCS.24.19","DOIUrl":"https://doi.org/10.4204/EPTCS.24.19","url":null,"abstract":"Multiplication of n-digit integers by long multiplication requires O(n 2 ) operations and can be time-consuming. A. Schonhage and V. Strassen published an algorithm in 1970 that is capable of performing the task with only O(nlog(n)) arithmetic operations over C; naturally, finite-precision approximations to C are used and rounding errors need to be accounted for. Overall, using variable-precision fixed-point numbers, this results in an O(n(log(n)) 2+\" )-time algorithm. However, to make this algorithm more efficient and practical we need to make use of hardware-based floating- point numbers. How do we deal with rounding errors? and how do we determine the limits of the fixed-precision hardware? Our solution is to use interval arithmetic to guarantee the correctness of results and deter- mine the hardware's limits. We examine the feasibility of this approach and are able to report that 75,000-digit base-256 integers can be han- dled using double-precision containment sets. This demonstrates that our approach has practical potential; however, at this stage, our implemen- tation does not yet compete with commercial ones, but we are able to demonstrate the feasibility of this technique.","PeriodicalId":54499,"journal":{"name":"Reliable Computing","volume":"41 1","pages":"151-159"},"PeriodicalIF":0.0,"publicationDate":"2010-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82675247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms 区间不确定性下计算总体方差和熵:线性时间算法

Reliable Computing Pub Date : 2007-12-01 DOI: 10.1007/s11155-007-9045-6

G. Xiang, M. Ceberio, V. Kreinovich

引用次数: 28

Determining the Positive Definiteness Margin of Interval Matrices 区间矩阵正定边的确定

Reliable Computing Pub Date : 2007-12-01 DOI: 10.1007/s11155-007-9046-5

L. Kolev

引用次数: 6

Computing the Pessimism of Inclusion Functions 计算包含函数的悲观主义

Reliable Computing Pub Date : 2007-12-01 DOI: 10.1007/s11155-007-9044-7

G. Chabert, L. Jaulin