Open Source Java Mathematics Software - Page 13

IFS Tools is a set of Java applets for the interactive, graphical construction of iterated function system (IFS) fractals. Output is in the form of IFS code and graphics.

Navigating Research Vessel through Ightaria, observing stars, landscape, and solving two geometrical puzzles. For High School students and other serious people hungry for Alien Geometry and Numbers.

Image Restoration and Inpainting: MinGW/OpenGL/Visual c++/Java image processing enhancing/restoring/detecting/recovering image parts(Old painting cracks...) FastRestorarion, 2D (Un)Splitted Linear Solver, nonlinear solver: conjugate gradient,QuasiNewton

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of that as Bits, subranges of them, and ints for sizes of its parts. Expansion ability for other kinds of compression, since Bits is a Java interface. Main functions on bits are substring, concat, number of 0 or 1 bits, and number of bits (size). All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. Sparse n dimensional matrix.

The SurfaceBuilder turns a collection of programs for implicity surface triangulation. It is usefull for any high school math student.

Impression is the flexible and extensible parser of mathematical expressions written in Java. It supports user defined operators, single or multi parameter functions and unlimited number of parameters. It is designed to use with numerical methods.

This project is a maht API based on Java

Fuzzy logic add-in for OpenOffice.org Calc. InrecoLAN FuzzyMath allows to perform ordinary arithmetic operations and use ordinary mathematical and financial functions with fuzzy numbers. Have any ideas how to improve this project - you are welcome!

The project Intergeo co-funded by the Community programme eContentplus develops an open-source library for the common file format it defines to allow developers of dynamic geometry systems to quickly integrate read support for such files.

A Kron server can assings some informations to its website. Assinging under discussion based on a mathematical model, a dynamics model.

JavaMath is oriented toward integrating existing compute engines, such as Maple, Mathematica or GAP, into Internet accessible mathematical services.

Interval Analysis is a collection of interval analysis tools, allowing for robust root-finding and tracking of bounds of numerical error due to uncertain inputs and floating-point error.

This program is for generating 3-D regular grid files from scattered data. It is GUI based, reads scattered data, gets options about how to make the 3-D interpolation.

Java implementation of investment science

A java tool used for row reducing matrices of varying sizes to row echelon/row reduced echelon forms. It is intended to support basic row reduction over different fields, then expand to support other linear algebra operations and html output of working.

This project provides a set of libraries written in Java to easily manipulate Multi-Criteria Decision Aid (MCDA) concepts, especially related to outranking methods, and XMCDA files.

JAGAL provides implementations for directed graphs (weighted and unweighted) and varoius types of transition systems as well as utils for graph traversal and modification. JAGAL builds upon the Java library TOVAL (located at http://sourceforge.net/p/toval). To use JAGAL, make sure the TOVAL library is on the build path. This library uses and encloses jGraphX (https://github.com/jgraph/jgraphx). A documentation for JAGAL can be found under http://doku.telematik.uni-freiburg.de/jagal.

The project aims to build a set of Java-based mathematical programs.

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)

This if calculator for complex numbers. It works with algebraic and trigonometrical form and has multiple memory slots. There are many mathematical functions like sin, cos and etc.

Planimetric Geometry (JCabri) is a rewrite of Cabri Geometry in Java. It provides solution for doing geometric constructions in 2D and exporting them as an animated GIF or Java applet.

JCalc is GUI calculator written entirely in Java. It can be run cross-platform on any OS with a Java Virtual Machine. It shall be portable, stable, and efficient.

JCharacterMatcher is an application for matching characters represented as graphs. It computes the distance between two characters. The smaller it is, the bigger is the probability that both graphs represent the same character.

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

A java project to create a library that can calculate decompression schemes for diving. Different open source algorithms can be chosen to use for the calculation. For example Bühlmann and VPM.