Open Source Assembly Mathematics Software for Linux

mcrypt, and the accompanying libmcrypt, are intended to be replacements for the old Unix crypt, except that they are under the GPL and support an ever-wider range of algorithms and modes.

CLISP is a portable ANSI Common Lisp implementation and development environment by Bruno Haible. Interpreter, compiler, debugger, CLOS, MOP, FFI, Unicode, sockets, CLX. UI in English, German, French, Spanish, Dutch, Russian, and Danish.

Freemat is an interpreted, matrix-oriented development environment for engineering and scientific applications, similar to the commercial package MATLAB. Freemat provides visualization, image manipulation, and plotting as well as parallel programming.

Check yafu on github for the latest code. YAFU (with assistance from other free software) uses the most powerful modern algorithms (and implementations of them) to factor input integers in a completely automated way. The automation within YAFU is state-of-the-art, combining factorization algorithms in an intelligent and adaptive methodology that minimizes the time to find the factors of arbitrary input integers. Most algorithm implementations are multi-threaded, allowing YAFU to fully utilize multi- or many-core processors (including SNFS, GNFS, SIQS, and ECM). YAFU is primarily a command-line driven tool. You provide the number to factor and, via screen output and log files, YAFU will provide you the factors. There is also an interactive environment similar to MATLAB or PARI/GP, where you can type commands and store results. YAFU is very customizable, through the optional use of many many command line parameters and a very capable expression inter

OpenPFGW is software that is designed to perform PRP and primality tests on numbers of specific forms. This software currently run on any x86 hardware with the support of George Woltman's gwnum library, the same library behind GIMPS and Prime95.

Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible

A generic C++ matrix library using expression template and metaprogramming to provide specialized code for various kind of matrix operations.

Centrinia is a modern mathematical modules library. It will also incorporate a Computer Algebra System.

A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. A sample implementation (a patch to the LLR program) is available from Batalov. [1] P.Berrizbeitia B.Iskra, 2010; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.311 [2] OEIS: http://oeis.org/

This is meant to be a powerful, but easy to use math software. It's by the user and for the users.

FFFF is the fastest Win32/OSX/Linux/IRIX Mandelbrot generator. Features OpenGL, realtime zoom, SSE/AltiVec QuadPixel, SSE2/3DNow! DualPixel calc, FPU per pixel calc, GPU asm (Fragment/Vertex) calc, multiprocessor support, and benchmarking. Opt asm code!

Floating point library for PIC micro controllers

This is a port of the GNU MultiPrecision library of C arbitrary-precision arithmetic routines to IA-64, with a focus on efficient (assembly) IA-64 routines for mul_basecase.c and sqr_basecase.c

This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.

Magneticle is a 3D OpenGL physical simulation that applies the Biot-Savart law to charged particles operating inside a magnetic field produced by a current-carrying wire modeled as an arbitrary space curve.

Iterate function viewer for Windows and Linux. It has built in 14 different iterate {Mandelbrot) functions. Many possibilities for changing parameters, saving as bitmap or small file. windows-32. Linux 32 - 64bit. Low level written in assembler.

A strong, yet minimalistic Math-oriented Programming Language (MML) providing an easy-to-use console and a command-line script interpreter, targetted towards fast calculations for extremely big numbers, and bundled with a number of math libraries.

Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)

The goal is to use distributed computing in the least bandwidth-intensive way to find a large prime number. We will have four parts to the project.

This library is meant for high performance calculations for science or 3D games/rasterizers using SIMD instructions of x86 processors to allow an unparalleled level of optimization. This takes advantage of MMX, 3DNow!, 3DNow!+/MMX+, & SSE/SSE2/SSE3/SSSE3

Improving the speed of the signal analysis code for Seti@home. Leveraging modern processors advanced features such as SIMD and parallel execution units, as well as identifying better methods to code existing functions.

The Wolfram Machine project is an effort to create a set of documentation and useful modules (both hardware and software) for a computing architecture based on the mathematical theories presented in Steven Wolfram's book _A_New_Kind_of_Science_.

A Interactive Network VideoGame

Hosting home-made software which is mathematically proven to be correct. We make use of tools like HOL, PVS, ...

A command line calculator capable of complex arithmetics.