Foundations of exact rounding

Chee K. Yap, Jihun Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings
Number of pages17
StatePublished - 2009
Event3rd International Workshop on Algorithms and Computation, WALCOM 2009 - Kolkata, India
Duration: Feb 18 2009Feb 20 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5431 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd International Workshop on Algorithms and Computation, WALCOM 2009

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Foundations of exact rounding'. Together they form a unique fingerprint.

Cite this