The Exact Real Arithmetical Algorithm in Binary Continued Fractions

P. Kurka
{"title":"The Exact Real Arithmetical Algorithm in Binary Continued Fractions","authors":"P. Kurka","doi":"10.1109/ARITH.2015.20","DOIUrl":null,"url":null,"abstract":"The exact real binary arithmetical algorithm is an on-line algorithm which computes the sum, product or ratio of two real numbers to arbitrary precision. The algorithm works in general Moebius number systems which represent real numbers by infinite products of Moebius transformations. We consider a number system of binary continued fractions in which this algorithm is computed faster than in the binary signed system. Moreover, the number system of binary continued fractions circumvents the problem of nonredundancy and slow convergence of continued fractions.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"44 1","pages":"168-175"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 22nd Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.2015.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The exact real binary arithmetical algorithm is an on-line algorithm which computes the sum, product or ratio of two real numbers to arbitrary precision. The algorithm works in general Moebius number systems which represent real numbers by infinite products of Moebius transformations. We consider a number system of binary continued fractions in which this algorithm is computed faster than in the binary signed system. Moreover, the number system of binary continued fractions circumvents the problem of nonredundancy and slow convergence of continued fractions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二元连分数的精确实数算法
精确实数二进制算术算法是一种将两个实数的和、积或比计算到任意精度的在线算法。该算法适用于用莫比乌斯变换的无穷积表示实数的一般莫比乌斯数系统。我们考虑了一个二进制连分制的数系统,在这个数系统中,该算法的计算速度比在二进制有符号系统中快。此外,二元连分式的数制还克服了连分式的非冗余性和收敛速度慢的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
External Reviewers ARITH 2021 Digit Recurrence Floating-Point Division under HUB Format Contributions to the Design of Residue Number System Architectures Precise and Fast Computation of Elliptic Integrals and Functions Reliable Evaluation of the Worst-Case Peak Gain Matrix in Multiple Precision
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1