Speculatively Redundant Continued Logarithm Representation

DOI10.1109/TC.2010.110MaRDI QIDQ5280671zbMATH OpenFDO

Authors Tomáš Brabec

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2010.110

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• Continued logarithm representation of real numbers
• Length of the continued logarithm algorithm on rational inputs
• Analysis of the continued logarithm algorithm
• Logarithmically convergent relaxation computation
• A generalized truncated logarithm
• Spigot algorithm and reliable computation of natural logarithm
• The iterated logarithmic algebra
• Redundant integer representations and fast exponentiation
• Computing Logarithmic Parts by Evaluation Homomorphisms✱
• Logarithmic reconstructions

Cited in

(1)

• Length of the continued logarithm algorithm on rational inputs

This page was built for publication: Speculatively Redundant Continued Logarithm Representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280671)