LCF: A Lexicographic Binary Representation of the Rationals

dc.creatorKornerup,Peter
dc.creatorMatula,David
dc.date1995
dc.date.accessioned2024-02-06T12:47:52Z
dc.date.available2024-02-06T12:47:52Z
dc.descriptionA binary representation of the rationals derived from their continued fraction expansions is described and analysed. The concepts "adjacency", "mediant" and "convergent" from the literature on Farey fractions and continued fractions are suitably extended to provide a foundation for this new binary representation system. Worst case representation-induced precision loss for any real number by a fixed length representable number of the system is shown to be at most 19% of bit word length, with no precision loss whatsoever induced in the representation of any reasonably sized rational number. The representation is supported by a computer arithmetic system implementing exact rational and approximate real computations in an on-line fashion.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-001-07-0484
dc.identifierhttps://lib.jucs.org/article/27141/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/6828
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 1(7): 484-503
dc.subjectComputer arithmetic
dc.subjectcontinued fractions
dc.subjectlexicographic
dc.subjectnumber systems
dc.subjectnumber theory
dc.subjectrational numbers.
dc.titleLCF: A Lexicographic Binary Representation of the Rationals
dc.typeResearch Article
Файлы
Коллекции