This work investigates two ways of enlarging the current floating-point environment:
As the number of various implementations for each mathematical function is large, this work is focused on code generation. We support black-box functions, so user-specified parametrized functions. This work contains a novel algorithm for domain splitting and an approach to replace branching on reconstruction by a polynomial. Since the revision of the IEEE754 Standard in 2008 it is possible to mix numbers of different precisions in one operation. However, there is no mechanism that allows users to mix numbers of different radices in one operation. This research starts an examination of mixed-radix arithmetic with the worst cases search for FMA. A novel algorithm to convert a decimal character sequence of arbitrary length to a binary floating-point number is presented. It is independent of currently-set rounding mode and produces correctly-rounded results.