Search Results for "git:/git.code.sf.net/p/docfetcher/code"

...Some major features are: A built-in expression generator, 32-bit colouring schemes for the fractals, multi-threaded and multi-server rendering! WOW! And lots, lots more... The source code has moved to GitLab: https://gitlab.com/jmmcg/alephone

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.

A command line calculator capable of complex arithmetics.

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.

libNT is a Number Theory Library which is based on a BigInteger Class. It will contain several algorithms for solving Number Theory Problems. Written in the IDE Code::Blocks

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

...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!

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.

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)