Open Source BSD Algorithms - Page 4

A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library.

A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.

Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.

RunAsApproximator es un programa java multilenguaje que implementa algoritmos numéricos. Los datos de entrada son aquellos requeridos por cada algoritmo y los de salida son resultado final y los datos intermedios necesarios para alcanzar su resolución.

A library with implementation of algorithms for solving Lot Sizing problems. The main focus of the library is on ease of use, while also attempting to keep it as efficient as possible.

This Python module provides basic facilities for mathematics on fixed-point numbers. The number of fractional binary digits is tunable, allowing near-arbitrary precision arithmetic. Arithmetic & functions such as sqrt, exp, log, sin & cos are available. For the latest releases please visit https://github.com/rwpenney/spfpm

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

TRSL is a C++ library that implements several (statistical) sampling schemes behind an (STL-like) iterator interface. The library may be used e.g. in particle filtering. It is distributed under the Boost SL (BSL is a free-software license).

A framework for utilising the Genetic Algorithm in the domain of Game Theory

SNOMP (SNOMP is Not OpenMP) is a library for semi-shared memory parallelization.

Topologia Digital (Digital Topology) is a project for the development of the practical exercises of the Digital Topology course in the Applied Mathematics Department of the Computer Science Faculty (Polytechnic University of Madrid, Spain).

Discrete Mathematics task solutioner. (The Theory For Scheduling / Network Graphs) Contains C++ mathematic algorithms and C# GUI.

Wallaroo is an infinite precision constraint solving and optimization library for linear constraints over the rational numbers. It handles equalities (=), inequalities (<=, >=), strict inequalities (<, >), and disequalities (!=).

A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem. The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra Group which does research about Constraint Programming and related technologies: Water Retention on Magic Squares with Constraint-Based Local Search http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-176018 I 'm posting two solvers in this project. One written in C++ which is the fastest, at least for the heavier objective functions, and a Dynadec Comet solver which lets you easily post new constraints along with the Magic-constraints. Author: Johan Öfverstedt

XMLMath evaluates mathematical, logical or textual expressions described in xml and prints the result. For example, to compute the result of 1 + 1, you would write: <add> <long value="1"/> <long value="1"/> </add>

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

Moved to GitHub https://github.com/fedups Algebraic equation processing at run time for Java programs. Supports variables, functions with parameters, rate table lookups, an embedded "if" function... Infinitely extensible, very small footprint.

An R package implementation of a consensus clustering methodology. This package allows users to perform re-sampling statistics based clustering using multiple clustering algorithms to assess the robustness of both clusters and members of clusters.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

iVSwap is a simple function which can be used as a library and swaps values between two variables in a mathematical way using a classic Boolean algebra law without the need of a buffer! The advantages of this technique is speed and portability.

ivl is a full-header template C++98 math library with convenient yet powerful syntax. It extends classic C++ syntax towards mathematical notation while making use of the language's elements like classes, structs, operators and functions. Expression written using ivl are excessively optimized. In other words, ivl allows writing simpler and more expressive statements using math-like formulas while taking care of optimizing them. ivl features arrays, tuples and custom function-like objects with left-right overloading, function pipelining and function vectorization, automatic lazy evaluation, sub-arrays and other views of a single or multidimensional arrays, stl-compatible iterators, multidimensional iterators and multithreading. ivl includes a rich set of functions and operators, including operations for image processing. Seperate modules are also included. The module ivl-lina implements a linear algebra LAPACK wrapper. The module ivl-cv integrates OpenCV into ivl.

JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/

A simple program that solves linear equation systems. As of now only numerical coefficients are supported. The program is very simple and not suited for big matrices, since it uses laplace's method.

Subroutines for estimation fractal dimention and related characteristics.

Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.