Debian Science Mathematics packages

4ti2 is a mathematical software package for algebraic, geometric and combinatorial problems on linear spaces.

This package provides the 4ti2 tool suite.

Agda é uma linguagem de programação funcional com tipagem dependente: ela possui famílias indutivas, que são similares a GADTs do Haskell, mas podem ser indexadas por valores e não somente por tipos. Ela também possui módulos parametrizáveis, operadores "mixfix", caracteres Unicode e uma interface Emacs interativa (o verificador de tipos pode ajudá-lo no desenvolvimento de seu código).

Agda também é um assistente de provas: ela é um sistema interativo para escrever e verificar provas. Agda é baseada na teoria de tipos intuicionística, um sistema fundacional para matemática construtiva desenvolvido pelo lógico sueco Per Martin-Löf. Ela possui muitas similaridades com outros assistentes de provas baseados em tipos dependentes tais como Coq, Epigram e NuPRL.

Este é um meta-pacote que fornece o modo de emacs Agda, o executável, a biblioteca padrão e sua documentação.

AUTO can do a limited bifurcation analysis of algebraic systems of the form

  f(u,p) = 0,  f,u in Rn
and of systems of ordinary differential equations of the form
  u'(t) = f(u(t),p),  f,u in Rn
subject to initial conditions, boundary conditions, and integral

constraints. Here p denotes one or more parameters. AUTO can also do certain continuation and evolution computations for parabolic PDEs. It also includes the software HOMCONT for the bifurcation analysis of homoclinic orbits. AUTO is quite fast and can benefit from multiple processors; therefore it is applicable to rather large systems of differential equations.

Axiom é útil para pesquisa e desenvolvimento de algorítimos matemáticos. Ele define uma hierarquia de tipos matematicamente corretos e fortemente tipados. Tem uma linguagem de programação e um compilador embutido.

Axiom está em desenvolvimento desde 1973 e já foi vendido como um produto comercial. Logo após, ele foi lançado como software livre.

Há esforços atualmente para estender este software para (a) desenvolver uma interface de usuário melhor (b) torná-lo funcional como uma ferramenta de ensino (c) desenvolver um protocolo de servidor de álgebra (d) integrar matemática adicional (e) reconstruir a álgebra num estilo de programação literária (f) integrar com programação lógica (g) desenvolver um Jornal de Axiom (Axiom Journal) com submissões avaliadas.

Este pacote contém o programa binário principal, toda a álgebra pré-compilada e módulos auto-carregáveis.

Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs.

This package provides the command line tool bliss.

The algorithm for the computation of sheaf cohomologies for line bundles on toric varieties presented in "Cohomology of Line Bundles: A Computational Algorithm" by Ralph Blumenhagen, Benjamin Jurke, Thorsten Rahn, and Helmut Roschy has been implemented in a convenient and high-performance C/C++ application called cohomCalg.

The optional cohomCalg Koszul extension serves as a Mathematica 7 frontend and allows for the easy computation of hypersurface and complete intersection cohomologies, following the material presented in "Cohomology of Line Bundles: Applications" by the same authors.

Cbc (Coin-or branch and cut) is an open-source mixed integer programming solver written in C++. It can be used as a callable library or as a stand-alone executable.

This package contains cbc executable.

CSDP is a library of routines that implements a predictor corrector variant of the semidefinite programming algorithm of Helmberg, Rendl, Vanderbei, and Wolkowicz. The code runs in parallel on shared memory multi-processor systems, and it makes effective use of sparsity in the constraint matrices.

CSDP is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research).

This package contains the binaries.

Bonmin (Basic Open-source Nonlinear Mixed INteger programming) is an open-source code for solving general MINLP (Mixed Integer NonLinear Programming) problems.

Bonmin is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research) and can be used with other COIN-OR packages that make use of cuts, such as the mixed-integer linear programming solver Cbc.

This package contains the header files for developers.

SYMPHONY is an open-source generic mixed-integer linear programs (MILP) solver, callable library, and extensible framework for implementing customized solvers SYMPHONY has a number of advanced capabilities, including the ability to solve multi-objective MILPs, the ability to warm start its solution procedure, and the ability to perform basic sensitivity analyses.

SYMPHONY is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research).

This package contains the symphony executable.

Coq is a proof assistant for higher-order logic, which allows the development of computer programs consistent with their formal specification. It is developed using Objective Caml and Camlp5.

This package provides coqtop, a command line interface to Coq.

A graphical interface for Coq is provided in the coqide package. Coq can also be used with ProofGeneral, which allows proofs to be edited using emacs and xemacs. This requires the proofgeneral package to be installed.

CryptoMiniSat is a modern, multi-threaded, simplifying SAT solver.

This package provides a command line interface which reads SAT formulas in conjunctive normal form in the DIMACS format with the extension of XOR clauses and decides whether they are satisfiable.

This package includes several programs to compute with elliptic curves over Q ; most notably mwrank (for 2-descent on elliptic curves over Q) and the modular symbol tools used to create the elliptic curve database.

This package provides tools to prove equational theorems: from a mathematical specification in many-sorted first-order logic with equality and an hypothesis/conjecture, it will look for a proof.

FEniCS is a collection of free software for automated, efficient solution of differential equations.

FEniCS has an extensive list of features, including automated solution of variational problems, automated error control and adaptivity, a comprehensive library of finite elements, high performance linear algebra and many more.

FEniCS is organized as a collection of interoperable components, including the problem-solving environment DOLFIN, the form compiler FFC, the finite element tabulator FIAT, the just-in-time compiler Instant, the code generation interface UFC, the form language UFL and a range of additional components.

This is a metapackage which depends on all FEniCS components.

This is the legacy version of FEniCS. You may want to consider installing the next-generation FEniCS-X (fenicx package).

This package includes William Hart's program to find prime factors of large integers (at least forty digits).

It does so using highly optimized multi-polynomial quadratic sieve.

This is a Symbolic Manipulation System. It reads symbolic expressions from files and executes symbolic/algebraic transformations upon them. The answers are returned in a textual mathematical representation. As its landmark feature, the size of the considered expressions in FORM is only limited by the available disk space and not by the available RAM.

fpLLL is a library for computing reduced (nearly orthogonal) bases for Euclidean lattices using the floating-point LLL algorithm.

fpLLL contains multiple different implementations of the floating-point LLL reduction algorithm, offering multiple different speed/guarantees ratios.

It contains a 'wrapper' that chooses the estimated best sequence of variants in order to provide a guaranteed output as fast as possible. In the case of the wrapper, the succession of variants is oblivious to the user.

This package contains the base tools using libfplll.

FreeFEM is a language adapted to Partial Differential equation. The underlying method used is the Finite Element Method. This tool has been successfully used as a teaching tool and even as a research tool.

FreeFem++ is an implementation of a language dedicated to the finite element method. It enables you to solve Partial Differential Equations (PDE) easily.

Problems involving PDE from several branches of physics such as fluid-structure interactions require interpolations of data on several meshes and their manipulation within one program. FreeFem++ includes a fast quadtree-based interpolation algorithm and a language for the manipulation of these data on multiple meshes. It contains also a powerful mesh generation and adaption tool integrated seamlessly in FreeFem++ called bamg.

FreeFem++ is written in C++ and the FreeFem++ language is a C++ idiom allowing for a smooth learning curve.

This package contains the executables of FreeFem++.

FreeMat is a free environment for rapid engineering and scientific prototyping and data processing. It is similar to commercial systems such as MATLAB from Mathworks, and IDL from Research Systems, but is Open Source. FreeMat is available under the GPL license.

Frobby is a software system and project for computations with monomial ideals. Frobby is free software and it is intended as a vehicle for computational and mathematical research on monomial ideals.

The current functionality includes Euler characteristic, Hilbert series, maximal standard monomials, combinatorial optimization on monomial ideals, primary decomposition, irreducible decomposition, Alexander dual, associated primes, minimization and intersection of monomial ideals as well as the computation of Frobenius problems (using 4ti2) with very mmlarge numbers. Frobby is also able to translate between formats that can be used with several different computer systems, such as Macaulay 2, Monos, 4ti2, CoCoA4 and Singular. Thus Frobby can be used with any of those systems.

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.

This is a dummy package that depends on the standard GAP components.

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.

This package contains the Character Table Library by Thomas Breuer.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This package provides for GAP routines for constructing, classifying, partitioning and studying block designs.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This package brings to GAP routines for factoring integers, in particular:

• Pollard's p-1
• Williams' p+1
• Elliptic Curves Method (ECM)
• Continued Fraction Algorithm (CFRAC)
• Multiple Polynomial Quadratic Sieve (MPQS)

It also provides access to Richard P. Brent's tables of factors of integers of the form b^k +/- 1.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This GAP package brings to GAP floating-point numbers with arbitrary precision; it is based on MPFR, MPFI, MPC, CXSC, and FPLLL.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This package implements computing with graphs and groups for GAP. GRAPE is primarily designed for constructing and analysing graphs related to groups, finite geometries, and designs; special emphasis is placed on the determination of regularity properties and subgraph structure.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This GAP package brings to GAP computing with error-correcting codes.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

LAGUNA stands for `Lie AlGebras and UNits of group Algebras'.

This package provides GAP with functionality for calculation of the normalized unit group of the modular group algebra of the finite p-group and for investigation of Lie algebra associated with group algebras and other associative algebras.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This package allows GAP to import and export mathematical objects encoded in OpenMath, for the purpose of exchanging them with other applications that are OpenMath enabled.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. In the example text, gap is used to analyse Rubik's Cube using group theory. A kernel implements a Pascal-like language.

This package contains the database of primitive groups.

This is a transitional package. It can be safely removed after the installation is complete.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. In the example text, gap is used to analyse Rubik's Cube using group theory. A kernel implements a Pascal-like language.

The Small Groups Library is a catalogue of groups of `small' order. This package contains the groups data and identification routines for groups of order up to 1000 except 512, 768 and groups whose order factorises in at most 3 primes.

Note that data for order 512, 768 and between 1000 and 2000 except 1024 are available separately in the gap-small-groups-extra packages.

This is a transitional package. It can be safely removed after the installation is complete.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. In the example text, gap is used to analyse Rubik's Cube using group theory. A kernel implements a Pascal-like language.

The Small Groups Library is a catalogue of groups of `small' order. This package contains the groups data and identification routines for groups

• of order at most 2000 except 1024.
• of cubefree order at most 50 000.
• of order p^n for n <= 6 and all primes p.
• of squarefree order.
• whose order factorises in at most 3 primes.
• of order q^n * p for q^n dividing 2^8, 3^6, 5^5, 7^4 and p prime different to q

The Small Groups Library provides access to these groups and a method to identify the catalogue number of a given group.

This is a transitional package. It can be safely removed after the installation is complete.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This package provides to GAP methods for the construction and analysis of finite nearrings.

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.

This package contains the GAP Library of Tables of Marks by L. Naughton and G. Pfeiffer.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas.

This package provides for GAP routines for working with toric varieties and dealing with cones and related combinatorial geometric object.

GAP is a system for computational discrete algebra with particular emphasis on computational group theory, but which has already proved useful also in other areas. In the example text, gap is used to analyse Rubik's Cube using group theory. A kernel implements a Pascal-like language.

This package contains the database of transitive groups.

This is a transitional package. It can be safely removed after the installation is complete.

The Mathematics Genealogy Grapher (Geneagrapher) is a software tool to gather the information for building math genealogy trees with data from the Mathematics Genealogy Project. The information extracted is stored in dot file format, which can then be passed to Graphviz to generate a graph.

This package contains the command-line tool.

GeoGebra é um programa de geometria dinâmica. Você pode fazer construções com pontos, vetores, segmentos, linhas, seções cônicas assim como funções e alterá-las dinamicamente em seguida. Por outro lado, equações e coordenadas podem ser digitadas diretamente.

Fornece suporte a várias construções geométricas, assim como a muitas ferramentas baseadas em cálculo (derivadas, circunferência osculatriz, ...).

Arquivos do GeoGebra podem ser exportados para muitos formatos diferentes, ou como miniaplicativos (applets) iterativos para páginas web.

Geomview é um programa de geometria interativo que é particularmente apropriado para pesquisa e educação em matemática. Em particular, geomview pode exibir coisas em espaços hiperbólicos e esféricos assim como em espaços euclideanos.

Geomview permite múltiplos objetos e câmeras controlados independentemente. Ele fornece controle interativo para movimento, aparência (incluindo iluminação, sombreamento e materiais), pinçar um objeto por vértice ou aresta, tirar fotos em formato de arquivos de imagem SGI ou Renderman RIB, e adicionar ou apagar objetos usando o mouse, por painéis de controle ou por teclas de atalho. Programas externos podem controlar aspectos desejados do visualizador (como carregar continuamente a alteração da geometria ou controlar o movimento de certos objetos) enquanto permite o controle interativo de todo o resto.

Gerris is a system for the solution of the partial differential equations describing fluid flow.

A brief summary of its main (current) features:

• Solves the time-dependent incompressible variable-density Euler, Stokes or Navier-Stokes equations
• Adaptive mesh refinement: the resolution is adapted dynamically to the features of the flow
• Entirely automatic mesh generation in complex geometries
• Second-order in space and time
• Unlimited number of advected/diffused passive tracers
• Flexible specification of additional source terms
• Portable parallel support using the MPI library
• Volume of Fluid advection scheme for interfacial flows

This package has MPI support built in.

GetDP is a general finite element solver using mixed elements to discretize de Rham-type complexes in one, two and three dimensions.

The main feature of GetDP is the closeness between the input data defining discrete problems (written by the user in ASCII data files) and the symbolic mathematical expressions of these problems.

See GetDP's reference manual for a more thorough overview of GetDP's capabilities: http://www.geuz.org/getdp

Gfan is a software package for computing Groebner fans and tropical varieties. These are polyhedral fans associated to polynomial ideals. The maximal cones of a Groebner fan are in bijection with the marked reduced Groebner bases of its defining ideal. The software computes all marked reduced Groebner bases of an ideal. Their union is a universal Groebner basis. The tropical variety of a polynomial ideal is a certain subcomplex of the Groebner fan. Gfan contains algorithms for computing this complex for general ideals and specialized algorithms for tropical curves, tropical hypersurfaces and tropical varieties of prime ideals. In addition to the above core functions the package contains many tools which are useful in the study of Groebner bases, initial ideals and tropical geometry. Among these are an interactive traversal program for Groebner fans and programs for graphical renderings.

For ordinary Groebner basis computations Gfan is not competitive in speed compared to programs such as CoCoA, Singular and Macaulay2.

GiNaC (which stands for "GiNaC is Not a CAS (Computer Algebra System)") is a library for doing symbolic (i.e. non-numeric) computation directly in the C++ programming language.

This package provides some additional tools, like the popular ginsh (GiNaC interactive shell) and viewgar (for inspecting GiNaC archive files).

Gmsh é um gerador de grade de elementos finitos 3D com um motor CAD integrado e pós-processador. Seu objetivo de design é fornecer uma ferramenta de malha rápida, leve e fácil de usar com entrada paramétrica e recursos avançados de visualização. O Gmsh é construído em torno de quatro módulos: geometria, malha, solucionador e pós-processamento. A especificação de qualquer entrada para esses módulos é feita interativamente usando a interface gráfica de usuário(a) ou em arquivos de texto ASCII usando a própria linguagem de script do Gmsh.

Consulte o manual de referência do Gmsh para obter uma visão geral mais completa dos recursos do Gmsh.

Desenho de grafos trata do problema de visualizar informação estrutural construindo representações geométricas de redes e grafos abstratos. Geração automática de desenhos de grafos tem importantes aplicações em tecnologias chave tais como projeto de banco de dados, engenharia de software, VLSI, projeto de rede e interfaces visuais em outros domínios. Situações onde essas ferramentas podem ser muito úteis:

• Você precisa reestruturar um programa e precisa primeiro entender as relaçoes entre os seus tipos, procedimentos e códigos fonte
• Você precisa encontrar os gargalos em um "backbone" de internet - não apenas links individuais, mas suas relações
• Você está depurando um protocolo ou microarquitetura representada como uma máquina de estado finito e precisa descobrir como surge um certo estado de erro
• Você gostaria de procurar em um esquema de banco de dados, base de conhecimento ou programa distribuído representado graficamente
• Você gostaria de ter uma visão geral de uma coleção de documentos vinculados
• Você gostaria de descobrir padrões e comunidades de interesse em um] banco de dados de chamadas de telefone ou mensagens de e-mail

Este pacote contém as ferramentas de linha de comando.

HOL Light is an interactive theorem prover for Higher-Order Logic with a very simple logical core running in an OCaml toplevel. HOL Light is famous for the verification of floating-point arithmetic as well as for the Flyspeck project, which aimed at the formalization of Tom Hales' proof of the Kepler conjecture.

Julia is a high-level, high-performance dynamic programming language for technical computing, with syntax that is familiar to users of other technical computing environments. It provides a sophisticated compiler, distributed parallel execution, numerical accuracy, and an extensive mathematical function library. The library, mostly written in Julia itself, also integrates mature, best-of-breed C and Fortran libraries for linear algebra, random number generation, FFTs, and string processing. Julia programs are organized around defining functions, and overloading them for different combinations of argument types (which can also be user-defined).

This package provides a complete Julia installation (JIT compiler, standard library, text-based user interface).

lcalc is a program for computing zeros and values of L-functions. Supported L-functions include the Riemann zeta function, the L-function of the Ramanujan delta function, and L-functions of elliptic curves defined over the rationals.

JGraphT is a free Java class library that provides mathematical graph-theory objects and algorithms. In JGraphT, a graph is defined as a set of vertices connected by a set of edges.

It is possible to define graphs, to modify, compare or generate them, to run many algorithms through them. One may also import or export graphs.

GNU libmatheval is a library comprising of several procedures that make it possible to create an in-memory tree representation of mathematical functions over single or multiple variables and later use this representation to evaluate functions for specified variable values, to create corresponding trees for function derivatives over specified variables or to print textual representations of in-memory trees to a specified string. The library supports arbitrary variable names in expressions, decimal constants, basic unary and binary operators and elementary mathematical functions.

This package contains the runtime shared library.

O problema de programação linear (PL) pode ser formulado como: Resolva A.x >= V1, com V2.x maximal. A é uma matriz, x é um vetor de variáveis (não-negativas), V1 é um vetor chamado "lado direito da equação", e V2 é um vetor especificando a função objetivo.

Um problema de programação linear inteira (PLI) é um PL com a restrição de que todas as variáveis sejam inteiras. Num problema de programação linear inteira mista (PLIM), algumas das variáveis são inteiras e outras são reais.

O programa lp_solve resolve problemas PL, PLI e PLIM. Ele é levemente mais genérico que o sugerido acima, já que cada linha de A (especificando uma restrição) pode ter sua própria (in)equação, <=, >= ou =. O resultado especifica os valores de todas as variáveis.

lp_solve usa o algoritmo 'Simplex' e métodos de matrizes esparsas para problemas LP puros. Se uma ou mais das variáveis é declarada inteira, o algoritmo Simplex é iterado com um algoritmo de bifurcação e limite ("branch and bound"), até que a solução ótima desejada ser encontrada. lp_solve pode ler arquivos de entrada no formato MPS.

The "Littlewood-Richardson Calculator" is a package of C programs for computing Littlewood-Richardson coefficients, providing fast calculation of single LR coefficients, products of Schur functions, and skew Schur functions. Its interface uses the same notation as the SF package of John Stembridge, to make it easier to use both packages at the same time.

This package contains the command-line programs.

A convex polyhedron is the set of points satisfying a finite family of linear inequalities. The study of the vertices and extreme rays of such systems is important and useful in e.g. mathematics and optimization. In a dual interpretation, finding the vertices of a (bounded) polyhedron is equivalent to finding the convex hull (bounding inequalities) of an (arbitrary dimensional) set of points. Lrs (lexicographic reverse search) has two important features that can be very important for certain applications: it works in exact arithmetic, and it consumes memory proportional to the input, no matter how large the output is.

Macaulay 2 is a software system for algebraic geometry research, written by Daniel R. Grayson and Michael E. Stillman. Based on Groebner bases, it provides algorithms for computing homological invariants of rings and modules.

This package contains the architecture dependent portion of Macaulay2.

Magnus is a simple screen magnifying glass. It nicely integrates with X11 desktops like MATE or Xfce (probably with others not named here, too).

Visually impaired users may find this tool helpful for zooming into certain screen areas in order to improve readability/visibilty of fonts, icons and other data.

Mathicgb is a program for computing Groebner basis and signature Groebner bases. Mathicgb is based on the fast data structures from mathic.

The paper "Practical Groebner Basis Computation" describes the algorithms in Mathicgb from a high level. It was presented at ISSAC 2012 and is available at http://arxiv.org/abs/1206.6940

This package contains the command line tool.

Mathomatic implements most of the rules of algebra for the mathematical operators +, -, *, /, % (modulus), and power (including roots).

Mathomatic can symbolically:

• combine and solve equations,
• completely simplify and compare expressions and equations,
• do simple calculus transformations and series,
• do standard, complex number, modular, and polynomial arithmetic,
• generate optimized C, Java, and Python language code from simplified equations,
• plot expressions with gnuplot in two or three dimensions,
• do quick calculations, colorize expressions, etc.

Maxima is a fully symbolic computation program. It is full featured doing symbolic manipulation of polynomials, matrices, rational functions, integration, Todd-coxeter methods for finite group analysis, graphing, multiple precision floating point computation. It has a symbolic source level debugger for maxima code. Maxima is based on the original Macsyma developed at MIT in the 1970s. It is quite reliable, and has good garbage collection, and no memory leaks. It comes with hundreds of self tests.

The maxima-sage packages are meant to be used together with SageMath. They contain the version of Maxima that works together with the SageMath version in Debian and use ECL instead of GCL as Lisp compiler. To use Maxima by itself, the more complete and up-to-date maxima package is recommended.

This package contains the main executables and base system files.

The MCL package is an implementation of the MCL algorithm, and offers utilities for manipulating sparse matrices (the essential data structure in the MCL algorithm) and conducting cluster experiments.

MCL is currently being used in sciences like biology (protein family detection, genomics), computer science (node clustering in Peer-to-Peer networks), and linguistics (text analysis).

Despite the NP completeness of the satisfiability problem of Boolean formulas (SAT), SAT solvers are often able to decide this problem in a reasonable time frame. As all other NP complete problems are reducible to SAT, the solvers have become a general purpose tool for this class of problems.

MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT. Winning all the industrial categories of the SAT 2005 competition, MiniSat is a good starting point both for future research in SAT, and for applications using SAT.

Model Builder is a graphical tool for designing, simulating and analyzing Mathematical model consisting of a system of ordinary differential equations(ODEs).

MUMPS implements a direct solver for large sparse linear systems, with a particular focus on symmetric positive definite matrices. It can operate on distributed matrices e.g. over a cluster. It has Fortran and C interfaces, and can interface with ordering tools such as Scotch.

nauty (No AUTomorphisms, Yes?) is a set of procedures for computing automorphism groups of graphs and digraphs. This mathematical software suite is developed by Brendan McKay and Adolfo Piperno: http://pallini.di.uniroma1.it

nauty computes graph information in the form of a set of generators, the size of the group, and the orbits of the group; it can also produce a canonical label. The nauty suite is written in C and comes with a command-line interface, a collection of command-line tools, and an Application Programming Interface (API).

This package provides the nauty interface named dreadnaut, and a small collection of utilities called gtools.

NETGEN é um gerador automático de estruturas entrelaçadas tetraédricas 3d. Ele aceita entrada de geometria sólida construtiva (CSG - constructive solid geometry) ou representação limítrofe (BRep) formato de arquivo STL. O NETGEN contém módulos para otimização de estruturas entrelaçadas e refinamento hierárquico.

Normaliz is a mathematical tool for computations in affine monoids, vector configurations, lattice polytopes, and rational cones.

This dummy package provides the standard installation.

Octave é uma linguagem de alto nível (quase totalmente compatível com o MATLAB®) criada principalmente para cálculos numéricos. Ela provê uma interface de linha de comando conveniente para a resolução numérica de problemas lineares e não-lineares.

Octave pode ser estendido dinamicamente com arquivos C++ fornecidos pelo usuário.

Este pacote contém várias ferramentas para trabalhar com polítopos integrais (lattice polytopes):

• mori.x calcula triangulações em estrela de um polítopo
• cws.x cria sistemas de peso e sistemas de peso combinados
• class.x classifica polítopos reflexivos
• poli.x calcula dados de um polítopo
• nef.x calcula números de Hodge de partições nef

PARI/GP is a widely used computer algebra system designed for fast computations in number theory (factorizations, algebraic number theory, elliptic curves...), but also contains a large number of other useful functions to compute with mathematical entities such as matrices, polynomials, power series, algebraic numbers etc., and a lot of transcendental functions. PARI is also available as a C library to allow for faster computations.

Originally developed by Henri Cohen and his co-workers (University Bordeaux I, France), PARI is now under the GPL and maintained by Karim Belabas with the help of many volunteer contributors.

This package contains the GP calculator.

Persalys is a graphical user interface for OpenTURNS, dedicated to the treatment of uncertainty and the management of variabilities. The software is a tool between the computer simulation, probabilistic analyses and the data sciences. The interface is available in French or in English.

Persalys allows one to:

• create mathematical models: analytical, coupling with an external model (finite elements, ...), FMU;
• analyse the variability of one's parameters thanks to many methods and visualisation tools;
• statistically analyse one's measuring data, infer probability distributions or create metamodels.

PHCpack is a software package to solve polynomial systems by homotopy continuation methods.

A polynomial system is given as a sequence of polynomials in several variables. Homotopy continuation methods operate in two stages. In the first stage, a family of polynomial systems (the so-called homotopy) is constructed. This homotopy contains a polynomial system with known solutions. In the second stage, numerical continuation methods are applied to track the solution paths defined by the homotopy, starting at the known solutions and leading to the solutions of the given polynomial system.

This package contains the command line interface to PHCpack.

This package contains a command-line reference implementation of the Edge Addition Planarity Algorithm, which is the best linear-time method to embed a planar graph and isolate planarity obstructions.

Polylib is a free C library for doing computations on polyhedra. The library is operating on objects like vectors, matrices, lattices, polyhedra, Z-polyhedra, unions of polyhedra and other intermediary structures. It provides functions for all important operations on these structures.

This package contains various utilities to perform polyhedral operations.

Proof General is a major mode to turn Emacs into an interactive proof assistant to write formal mathematical proofs using a variety of theorem provers.

This package provides Proof General support for Coq. (There is no other proof assistant that one could sensibly support.)

This package provides the Prover9 resolution/paramodulation theorem prover and the Mace4 countermodel generator.

Prover9 is an automated theorem prover for first-order and equational logic. It is a successor of the Otter prover. Prover9 uses the inference techniques of ordered resolution and paramodulation with literal selection.

The program Mace4 searches for finite structures satisfying first-order and equational statements, the same kind of statement that Prover9 accepts. If the statement is the denial of some conjecture, any structures found by Mace4 are counterexamples to the conjecture.

Mace4 can be a valuable complement to Prover9, looking for counterexamples before (or at the same time as) using Prover9 to search for a proof. It can also be used to help debug input clauses and formulas for Prover9.

DEAP is a novel evolutionary computation framework for rapid prototyping and testing of ideas. It seeks to make algorithms explicit and data structures transparent. It works in perfect harmony with parallelisation mechanism such as multiprocessing and SCOOP.

This package contains the modules for Python3.

DOLFIN is the Python and C++ interface of the FEniCS project for the automated solution of differential equations, providing a consistent PSE (Problem Solving Environment) for solving ordinary and partial differential equations. Key features include a simple, consistent and intuitive object-oriented API; automatic and efficient evaluation of variational forms; automatic and efficient assembly of linear systems; and support for general families of finite elements.

This is the base package depending on specific dolfin builds. By default the version built against the preferred version of PETSc in /usr/lib/petsc is selected (with 32-bit indexing, but the alternative version (64-bit PETSc) can be selected by setting the environment variable PETSC_DIR.

This is the legacy version of DOLFIN, you may want to install the next-generation python3-dolfinx (DOLFIN-X) instead.