The calculation of a logarithm is complicated in principle. It can only be achieved "with paper and pencil" by repeating certain calculation processes many times, whereby the result of the step just performed is used as the starting point for the next calculation step (iterative procedure). In most cases, the value can only be approximated (approximation). There are various possible procedures for this, some of which are shown below. Initially, the result of these partial steps is relatively far away from the correct result, but becomes more exact with each further calculation step, converging to the correct result. Such iterative arithmetic operations are very well suited to be performed automatically with a pocket calculator or computer, where only one key has to be pressed (if provided on the device) to calculate the logarithm of the entered number to a fixed base (usually Euler's number e (2.718...) or the number 10). The following calculation examples are each only suitable for calculating the logarithm of any number to the base e (natural logarithm) or 2.
Power series
The power series development of the natural logarithm around the development point 1 results for

It does not converge very fast at the edges of the convergence interval, the remainder of the
-th partial sum has the size

This series can also be represented as a continued fraction:

Using the formula
one can reduce the calculation of the logarithm for any
to that for values in the interval i.e., the calculation of the logarithm for any x {\displaystyle x} can be reduced to
that for values in the interval [ 2 3 ]. h., one always finds
and
with
and 
More flexibility in the reduction to numbers close to 1 and a halving of the computational effort is offered by the following series representation, which is based
on the power series expansion of the atranger hyperbolicus

with the residual element estimation

The series converges for
, shows
similar convergence behaviour for
and converges better the closer }
is to 1. To achieve this, one again uses

By choosing a suitable integer
one can always achieve that
holds and thus increases the convergence speed of the series, which one now
calculates for However, one must additionally
calculate an approximation for , which is done over the same series. Such a transformation to an interval
by scaling
with
is also
possible for other values of , due to the particularly simple handling of the 2 numbers represented in binary, another factor is rarely used.
Additive decomposition
The natural logarithm
per

in relation to what is dissolved on the other side.

results.
The logarithms of the positive integer numerals can thus be expressed in ascending ones of the form

and calculate it. This improves the convergence behaviour of the Taylor series

slightly with increasing 
With the help of the addition theorem

and thus also can be decomposed additively
. Here, for the sake of clarity, the addition theorem is expressed as a group law 

as well as its
-fold multiplication as

formulated.
For practical calculations, decompositions are preferred whose summands have a one in the numerator. As in the case of the arc tangent, the doubling leaves

get the ones in the counter.
Limit values according to Hurwitz
The following limits apply to the natural logarithm
![{\displaystyle \ln x=\lim _{n\to \infty }n\left({\sqrt[{n}]{x}}-1\right)=\lim _{n\to \infty }n\left(1-{\frac {1}{\sqrt[{n}]{x}}}\right)}](https://www.alegsaonline.com/image/f7901ca277e9fe1a5be535f262d7d4a84fc51a3f.svg)
and synonymously

which one can easily confirm with de l'Hospital's rule.
This is the basis for the limits of the sequences
and given by Adolf Hurwitz for the natural logarithm.
which are based on

where

are defined. Because
because a n {\displaystyle
decreasing and b n {\displaystyle
increasing, the convergence of these two sequences follows. Due to
and
the equality of the two limit values results:

For a practical calculation of ln
however, these limits are not well suited because of the cancellation that occurs.
Calculation of individual binary digits
Another way to calculate the logarithm is to determine the digits of the binary representation of the logarithm to the base 2 one after the other. This method is particularly easy to implement on arithmetic units, as it avoids time-consuming divisions and is also easy to convert to fixed-point arithmetic.
First, the digits before the decimal point of the two logarithm (always in the dual system) are
determined by counting the digits before the decimal point of the number and
normalised to values between 1 and 2 by shifting.
The logarithm of
then has the representation

Squaring thus
shifts the logarithm one binary digit to the left, possibly making the pre-decimal place one. This is the case when
. In this case,
normalised again by division by 2, which has no influence on the remaining decimal places. This results in the following sketch of the procedure:
INPUT 1 ≤ x < 2 OUTPUT Decimal places bi of
the binary representation of log2(x
) i ← 0 LOOP i ← i + 1 x ← x2 IF x ≥ 2 THEN x ← x / 2
bi ← 1 ELSE
bi ← 0 END IF END LOOP
Analogue computer
To calculate the logarithm with the aid of an analogue calculator - for example, the generation of an electrical output voltage
which takes the logarithm of the nominal value of the input voltage
can make use of the exponential course of the current-voltage characteristic of a diode. The sketch on the right shows the basic construction of a logarithmiser with an operational amplifier, a diode
and a resistor
.