TY - GEN
T1 - Foundations of exact rounding
AU - Yap, Chee K.
AU - Yu, Jihun
PY - 2009
Y1 - 2009
N2 - Exact rounding of numbers and functions is a fundamental computational problem. This paper introduces the mathematical and computational foundations for exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.
AB - Exact rounding of numbers and functions is a fundamental computational problem. This paper introduces the mathematical and computational foundations for exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.
UR - http://www.scopus.com/inward/record.url?scp=67650507301&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67650507301&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-00202-1_2
DO - 10.1007/978-3-642-00202-1_2
M3 - Conference contribution
AN - SCOPUS:67650507301
SN - 3642002013
SN - 9783642002014
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 15
EP - 31
BT - WALCOM
T2 - 3rd International Workshop on Algorithms and Computation, WALCOM 2009
Y2 - 18 February 2009 through 20 February 2009
ER -