Jump to content

Class Library for Numbers

From Wikipedia, the free encyclopedia
CLN, a Class Library for Numbers
Developer(s)Bruno Haible and Richard B. Kreckel
Stable release
1.3.7 / January 22, 2024; 10 months ago (2024-01-22)
Written inC++11
Operating systemCross-platform
TypeMathematical software
LicenseGPL
Websitehttps://www.ginac.de/CLN/

Class Library for Numbers (CLN) is a free library for arbitrary precision arithmetic. It operates on signed integers, rational numbers, floating point numbers, complex numbers, modular numbers, and univariate polynomials. Its implementation programming language is C++.

Details

[edit]

CLN uses object oriented techniques and operator overloading to achieve a natural algebraic syntax: The sum x of two variables a and b is written as x = a + b, as opposed to the function sum(&xab).

CLN uses class inheritance to model the natural subsets of the available number types: E.g. the integer class is a subtype of the rational class, just as the integer numbers are a subset of the rational numbers. The complex numbers and all its subtypes behave exactly like the types of numbers known to the Common Lisp language, giving CLN another meaning: it becomes an abbreviation of Common Lisp Numbers. Due to this, CLN can be and is used for implementations of Common Lisp, other interpreted languages, or computer algebra systems.

The implementation is efficient. It can be configured to use the GNU Multi-Precision Library as kernel for speed-critical inner loops and implements advanced algorithms like Schönhage–Strassen multiplication, binary splitting[1] for computing certain mathematical constants and others. All CLN objects are either immediate or reference counted, providing for non-interruptive garbage collection with no burden on the main application.

References

[edit]
  1. ^ Haible, Bruno; Papanikolaou, Thomas (1998). "Fast multiprecision evaluation of series of rational numbers". In Buhler, Joe P. (ed.). Algorithmic Number Theory. Lecture Notes in Computer Science. Vol. 1423. pp. 338–350. doi:10.1007/BFb0054873. ISBN 978-3-540-69113-6.
[edit]