Foundations of exact rounding

Chee K. Yap, Jihun Yu

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

Abstract

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: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings
Pages15-31
Number of pages17
Volume5431 LNCS
DOIs
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)03029743
ISSN (Electronic)16113349

Other

Other3rd International Workshop on Algorithms and Computation, WALCOM 2009
CountryIndia
CityKolkata
Period2/18/092/20/09

Fingerprint

Rounding
Number theory
Transcendental number
Elementary Functions

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yap, C. K., & Yu, J. (2009). Foundations of exact rounding. In WALCOM: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings (Vol. 5431 LNCS, pp. 15-31). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5431 LNCS). https://doi.org/10.1007/978-3-642-00202-1_2

Foundations of exact rounding. / Yap, Chee K.; Yu, Jihun.

WALCOM: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings. Vol. 5431 LNCS 2009. p. 15-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5431 LNCS).

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

Yap, CK & Yu, J 2009, Foundations of exact rounding. in WALCOM: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings. vol. 5431 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5431 LNCS, pp. 15-31, 3rd International Workshop on Algorithms and Computation, WALCOM 2009, Kolkata, India, 2/18/09. https://doi.org/10.1007/978-3-642-00202-1_2
Yap CK, Yu J. Foundations of exact rounding. In WALCOM: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings. Vol. 5431 LNCS. 2009. p. 15-31. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-00202-1_2
Yap, Chee K. ; Yu, Jihun. / Foundations of exact rounding. WALCOM: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings. Vol. 5431 LNCS 2009. pp. 15-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6bfe04b751ca415e881fcca6eda462c8,
title = "Foundations of exact rounding",
abstract = "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.",
author = "Yap, {Chee K.} and Jihun Yu",
year = "2009",
doi = "10.1007/978-3-642-00202-1_2",
language = "English (US)",
isbn = "3642002013",
volume = "5431 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "15--31",
booktitle = "WALCOM: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings",

}

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

SN - 3642002013

SN - 9783642002014

VL - 5431 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 15

EP - 31

BT - WALCOM: Algorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings

ER -