Open Source Java Mathematics Software for Linux

This project has moved. Please follow the WWW link below.

The JTS Topology Suite is an API for modelling and manipulating 2-dimensional linear geometry. It provides numerous geometric predicates and functions. JTS conforms to the Simple Features Specification for SQL published by the Open GIS Consortium.

BigAl is a free open source and platform independent software for calculating really BIG numbers. It supports not only standard arithmetic, but also exact period determination, predefined factorials, fibonacci with seeds, factorization, nth root, etc

QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output variables. - You can also reduce the number of table rows. - It allows you to name the input and output variables. - The table can be exported to HTML file and then you can use it in e.g. MS Word. - This program provides a comfortable interface, you can change fonts and colors. - It works on MS Windows, GNU/Linux, Mac OS.

JMathTeX - typesetting mathematics in Java. Provides Java classes for typesetting mathematical formulas as part of your applications user interface.

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.

oj! Algorithms - ojAlgo - is Open Source Java code that has to do with mathematics, linear algebra and optimisation; particularly (but certainly not exclusively) suitable for the financial domain.

Fully playable Java game demo illustrating basic game programming technics, such as sprite animation, pixmap fonts, time or frame related game loop, affine transformations, convolution filters, sound generation and playback...

Continuous wavelet transform library

Combean is a Java framework for mathematical structures and optimization algorithms. Through a set of Java interfaces and JavaBeans-based config, Combean glues optimization codes together - leading to more interoperable, adaptable and flexible solutions.

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

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

Fuzzy numbers and basic fuzzy arithmetics (+, -, *, /, 1/x) implementation written in Java. Should be used as a library, but it also has a GUI which demonstrates its capabilities (using SWT widgets).

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.

JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)

The K.U.Leuven JCHR System is an integration of Constraint Handling Rules (CHR) and Java designed with three aims in mind: user-friendliness, flexibility and efficiency. http://www.cs.kuleuven.be/~petervw/JCHR/

[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later.

Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.

The JAccumulator package brings the convenient type conversion and ad hoc composition capabilities of Javascript to Java programming structures. JAccumulator is dependent upon the Jupperware (http://jupperware.sf.net) to provide Javascript-like associative list capabilities and the convenience of easy hierarchical construction.

JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.

A graph library, developed in Java.

An online judge system to judge the ACM-ICPC programming contests.

The Latin Square Toolbox contains software tools for efficiently generating Latin squares and counting their transversals with various user-configurable options. This open source release aims to help educate folks on Latin squares and their important applications to cryptography. This version contains three tools: 0. Latin Square Generator (LSG) 1. Latin Square Transversal Counter (LSTC) 2. Latin Square Property Checker (LSPC)

Magic Fixed Point, it's an library that abstracts the use of fixed point math for environments that doesn't have floating point operations or in places that you don't want to use the traditional floating point operations.