## 13 Search Results

### GAP

GAP is a system for computational discrete algebra, with particular emphasis on Computational Group Theory. GAP provides a programming language, a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects. GAP is used in research and teaching for studying groups and their representations, rings, vector spaces, algebras, combinatorial structures, and more. GAP is developed by international cooperation. The system, including source, is distributed freely under the terms of the GNU General Public License. You can study and easily modify or extend GAP for your special use. The current version is GAP 4, the older version GAP 3 is still available.

More information### KANT

KASH/KANT is a computer algebra system for sophisticated computations in algebraic number fields and global function fields. It has been developed under the project leadership of Prof. Dr. M. Pohst at Technische Universität Berlin.

More information### LinBox

LinBox is a C++ template library for exact, high-performance linear algebra computation with dense, sparse, and structured matrices over the integers and over finite fields. LinBox has the following top-level functions: solve linear system, matrix rank, determinant, minimal polynomial, characteristic polynomial, Smith normal form and trace. A good collection of finite field and ring implementations is provided, for use with numerous black box matrix storage schemes.

More information### Maple

Maple is an environment for scientific and engineering problem-solving, mathematical exploration, data visualization and technical authoring.

More information### Normaliz

Normaliz is a tool for computations in affine monoids, vector configurations, lattice polytopes, and rational cones. Its input data can be specified in terms of a system of generators or vertices or a system of linear homogeneous Diophantine equations, inequalities and congruences or a binomial ideal. Normaliz computes the dual cone of a rational cone (in other words, given generators, Normaliz computes the defining hyperplanes, and vice versa), a placing (or lexicographic) triangulation of a vector configuration (resulting in a triangulation of the cone generated by it), the Hilbert basis of a rational cone, the lattice points of a lattice polytope, the normalization of an affine monoid, the Hilbert (or Ehrhart) series and the Hilbert (or Ehrhart) (quasi) polynomial under a Z-grading (for example, for rational polytopes), NEW: generalized (or weighted) Ehrhart series and Lebesgue integrals of polynomials over rational polytopes via NmzIntegrate, a description of the cone and lattice under consideration by a system of inequalities, equations and congruences

More information### NumXL

NumXL is a suite of time series Excel add-ins. It transforms your Microsoft Excel application into a first-class time series software and econometrics tool, offering the kind of statistical accuracy offered by the leading statistical packages. NumXL integrates natively with Excel, adding scores of econometric functions, a rich set of shortcuts, and intuitive user interfaces to guide you through the entire process.

More information### PLTMG

PLTMG is a package for solving elliptic partial differential equations in general regions of the plane. It is based on continuous piecewise linear triangular finite elements, and features adaptive local mesh refinement, multigraph iteration, and pseudo-arclength continuation options for parameter dependencies. It also provides options for solving several classes of optimal control and obstacle problems. The package includes an initial mesh generator and several graphics packages. Support for the Bank-Holst parallel adaptive meshing strategy is also provided. PLTMG is provided as Fortran (and a little C) source code, in both single and double precision versions. The code has interfaces to X-Windows, MPI, and Michael Holst's OpenGL image viewer SG. The X-Windows, MPI, and SG interfaces require libraries that are NOT provided as part of the PLTMG package.

More information### PolyBoRi

The core of PolyBoRi is a C++ library, which provides high-level data types for Boolean polynomials and monomials, exponent vectors, as well as for the underlying polynomial rings and subsets of the powerset of the Boolean variables. As a unique approach, binary decision diagrams are used as internal storage type for polynomial structures. On top of this C++-library we provide a Python interface. This allows parsing of complex polynomial systems, as well as sophisticated and extendable strategies for Gröbner base computation. PolyBoRi features a powerful reference implementation for Gröbner basis computation.

More information### RATS

RATS (Regression Analysis of Time Series) is a fast, efficient, and comprehensive econometrics and time series analysis software package.

More information### rbMIT

The rbMIT © MIT software package implements in Matlab® all the general reduced basis algorithms. The rbMIT © MIT software package is intended to serve both (as Matlab® source) "Developers" — numerical analysts and computational tool-builders — who wish to further develop the methodology, and (as Matlab® "executables") "Users" — computational engineers and educators — who wish to rapidly apply the methodology to new applications. The rbMIT software package was awarded with the Springer Computational Science and Engineering Prize in 2009.

More information### RCWA

RCWA is a package for the computer algebra system GAP. It provides implementations of algorithms and methods for computing in certain infinite permutation groups. The class of groups which RCWA in principle can deal with includes the finite groups, the free groups of finite rank, the free products of finitely many finite groups, certain infinite simple groups, certain divisible torsion groups and groups of many further types. It is closed under taking direct products and under taking wreath products with finite groups and with the infinite cyclic group (Z,+).

More information### Risa/Asir

Risa/Asir is a general computer algebra system and also a tool for various computation in mathematics and engineering. The development of Risa/Asir started in 1989 at FUJITSU. Binaries have been freely available since 1994 and now the source code is also free. Currently Kobe distribution is the most active branch of its development. We characterize Risa/Asir as follows: (1) An environment for large scale and efficient polynomial computation. (2) A platform for parallel and distributed computation based on OpenXM protocols.

More information### SINGULAR

SINGULAR is a Computer Algebra system for polynomial computations in commutative algebra, algebraic geometry, and singularity theory. SINGULAR's main computational objects are ideals and modules over a large variety of baserings. The baserings are polynomial rings over a field (e.g., finite fields, the rationals, floats, algebraic extensions, transcendental extensions), or localizations thereof, or quotient rings with respect to an ideal. SINGULAR features fast and general implementations for computing Groebner and standard bases, including e.g. Buchberger's algorithm and Mora's Tangent Cone algorithm. Furthermore, it provides polynomial factorizations, resultant, characteristic set and gcd computations, syzygy and free-resolution computations, and many more related functionalities. Based on an easy-to-use interactive shell and a C-like programming language, SINGULAR's internal functionality is augmented and user-extendible by libraries written in the SINGULAR programming language. A general and efficient implementation of communication links allows SINGULAR to make its functionality available to other programs.

More information