Computations involving very small (or very large numbers) can produce underflow (or overflow) errors, even when these numbers are represented as logarithms. When logarithmic representation is used, algorithms to effect addition and subtraction remain limited in range by underflow or overflow. The algorithms presented here extend the range of these operations to allow computations on smaller (or larger) numbers.
Citation:
David Primeaux, "Programming with Gaussian Logarithms to Compute the Approximate Addition and Subtraction of Very Small (or Very Large) Positive Numbers," snpd-sawn, pp.129-132, Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), 2005