Speculatively Redundant Continued Logarithm Representation

DOI10.1109/TC.2010.110zbMATH Open1367.65208MaRDI QIDQ5280671

Tomáš Brabec

Publication date: 27 July 2017

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

Mathematics Subject Classification ID

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

Related Items (1)

Length of the continued logarithm algorithm on rational inputs

Recommendations

• Title not available (Why is that?) 👍 👎
• Spigot algorithm and reliable computation of natural logarithm 👍 👎
• The iterated logarithmic algebra 👍 👎
• Continued logarithm representation of real numbers 👍 👎
• Redundant integer representations and fast exponentiation 👍 👎
• Analysis of the continued logarithm algorithm 👍 👎
• A generalized truncated logarithm 👍 👎
• Logarithmically convergent relaxation computation 👍 👎
• Length of the continued logarithm algorithm on rational inputs 👍 👎
• Computing Logarithmic Parts by Evaluation Homomorphisms✱ 👍 👎

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)