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 は依存型付けされた関数プログラミング言語です (Haskell の GADTs のよう な、帰納的定義型の種別を持ちますが、その型は型だけではなく値にインデックス されうる型です)。パラメータ付きモジュール、mixfix 演算子、Unicode 文字およ び Emacs 用対話的インターフェースを含みます (型検査器が、あなたのコードの開発を 補助します)。

Agda は定理証明支援系でもあります (証明を待ち、検査する対話的システムです)。 Agda は直観主義的な型理論に基づいています (スイスの論理学者 Per Martin-Löf によって開拓された構成的な数学の基礎理論です)。Coq, Epigram および NuPRL といった、依存型に基づいている他の定理証明支援系とも多くの類似点があります。

Agda の emacs mode、実行形式、標準ライブラリおよびそのドキュメントを提供する メタパッケージです。

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 は数学アルゴリズムの研究や開発に便利です。強く型付され、数学的に 正確な型階層を定義します。プログラミング言語と内蔵コンパイラを備えてい ます。

axiom は 1973 年から開発が続けられ、商用製品として販売されていました。 そしてフリーソフトウェアとしてリリースされました。

以下の事項を目指すべく、本ソフトウエアを拡張するための努力が行なわれて います:

 (a) より優れたインターフェイスの開発
 (b) 教育用ツールとして便利なものにする
 (c) 代数サーバプロトコルの開発
 (d) 追加された数学分野の統合
 (e) 読み書き可能なプログラミングスタイルでの代数の再構築
 (f) 論理プログラミングの統合
 (g) 校閲者の提案による Axiom Journal の開発

本パッケージには、メインプログラムバイナリおよび全ての前もってコンパイル された代数モジュールと、自動ロード可能なモジュールが含まれます。

Bliss は個別化と精緻化をもとに自己同形群や図の標準形を計算するための バックトラックアルゴリズムです。そのデータ構造やサブルーチン、枝刈りのヒュ ーリスティックスは巨大で疎なグラフを高速に処理するよう、特別に設計されてい ます。

このパッケージはコマンドラインツール 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) は、C++ で書かれたオープンソースの混合整数 プログラミグソルバです。呼び出し可能なライブラリとしても、スタンドアローン の実行可能ファイルとしても使えます。

本パッケージには cbc 実行可能ファイルが含まれます。

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 は高階論理の証明アシスタントで、コンピュータプログラムを形式的な仕様との 整合性を保ちながら開発できます。Objective Caml と Camlp5 を用いて 開発されています。

本パッケージは Coq へのコマンドラインインターフェース coqtop を提供します。

Coq のグラフィカルインターフェースは coqide パッケージが提供します。 Coq は ProofGeneral とも併用でき、証明を emacs や xemacs で 編集できるようになります。これには proofgeneral パッケージのインストールが 必要です。

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 は偏微分方程式に適した言語です。根本にある手法は有限要素法です。 このツールは教材としてだけではなく、研究道具としてもうまく使えます。

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 は、計算群論を特に重視した計算離散代数システムです。GAP プログラミン グ言語、GAP プログラミング言語で書かれた代数アルゴリズムを実装する数千も の関数、代数オブジェクトについての膨大なデータを提供します。群とその表現、 環、ベクトル空間、代数、組合せ構造についての学問を研究・教育するのに用い ることができます。

本パッケージは、標準的な GAP コンポーネントに依存するダミーパッケージです。

GAP は、計算群論を特に重視した計算離散代数システムです。GAP プログラミン グ言語、GAP プログラミング言語で書かれた代数アルゴリズムを実装する数千も の関数、代数オブジェクトについての膨大なデータを提供します。群とその表現、 環、ベクトル空間、代数、組合せ構造についての学問を研究・教育するのに用い ることができます。

本パッケージには、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 は、特定の計算群理論を重視した計算離散代数システムです。 GAP はプログラミング言語および、その言語で書かれた代数アルゴリズムを 実装する数千もの関数を備えたライブラリ、代数オブジェクトの大規模データ ライブラリを提供します。GAP は群とその表現、環、ベクトル空間、代数、 組み合わせ構造などなどについて教育・研究するのに用いられています。

本パッケージには、L. Naughton と G. Pfeiffer による、Tables of Marks の GAP ライブラリが含まれます。

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 is a dynamic geometry program. You can do constructions with points, vectors, segments, lines, conic sections as well as functions and change them dynamically afterwards. On the other hand, equations and coordinates can be entered directly.

Support for many geometric constructions is provided, as well as support for many calculus-based tools (derivatives, osculating circle, ...).

GeoGebra files can be exported in many different formats, or as interactive applets for web pages.

Geomview は対話的な幾何的図形ソフトウェアで、数学の研究および教育に特に適し ています。特に、geomview は双曲空間、球面空間やユークリッド空間にある物体を 表示できます。

Geomview では複数の対象物やカメラを各々独立に操作できます。動きや外観 (照明 や陰、素材感を含む)、オブジェクトや端・頂点の選択、SGI 画像ファイルまたは Renderman RIB 形式のスナップショットを対話的に制御できます。オブジェクトの 追加や削除は、マウスでの直接の操作、コントロールパネル、キーボードショート カットで行えます。(位置の変化を連続的にロードしたり、特定のオブジェクトの動 きを制御したり、といった) ビューアの望ましい機能を外部プログラムから制御し 実現できると同時に、その他あらゆる点について対話的に制御することが可能です。

Gerris は、流体を表す偏微分方程式を解くためのシステムです。

(現在の) 主要機能の概要は次の通りです:

• 時間依存の非圧縮性可変密度オイラー、ストークスまたは ナビエ・ストークス方程式を解きます
• 適合細分化格子 (AMR) 法: 分解能は流体の特徴に動的に適応します
• 複雑な形状の完全自動格子生成
• 空間と時間で二次オーダー
• 個数無制限の移流・拡散パッシブトレーサ
• 追加のソース項を柔軟に指定できます
• MPI ライブラリを使用した移植性の高い並列サポート
• 界面流体の Volume of Fluid (VOF) 法による移流スキーム

本パッケージには MPI サポートが組み込まれています。

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 ("GiNaC is Not a CAS (Computer Algebra System)" の略称) は記号的 (す なわち、数値的ではない) 計算用ライブラリであり、直接 C++ プログラミング言語 で書かれています。

本パッケージは 有名な ginsh (GiNaC 対話的シェル) や viewgar (GiNaC アーカイ ブファイルを調べるツール) のような追加ツールをいくつか提供します。

Gmsh is a 3D finite element grid generator with a build-in CAD engine and post-processor. Its design goal is to provide a fast, light and user-friendly meshing tool with parametric input and advanced visualization capabilities. Gmsh is built around four modules: geometry, mesh, solver and post-processing. The specification of any input to these modules is done either interactively using the graphical user interface or in ASCII text files using Gmsh's own scripting language.

See Gmsh's reference manual for a more thorough overview of Gmsh's capabilities.

グラフ描画は構造を持つ情報の視覚化の問題に対し、抽象的なグラフやネットワー クの幾何学的表現を作成することで対処します。グラフ描画の自動生成には、デー タベース設計や、ソフトウェアエンジニアリング、VLSI、ネットワーク設計、その 他の領域の視覚インタフェースなどのキーテクノロジにとって重要なアプリケー ションがあります。以下の状況では特に重要なツールとなる可能性があります。

• プログラムを再構成したいときに、プログラムの型、プロシージャ、ソース ファイルの関係性をまず理解する必要がある。
• インターネットバックボーンの個々の経路だけでなくその関係性におけるボト ルネックを見つける必要がある。
• 有限ステートマシンとして表わされるプロトコルやマイクロアーキテクチャを デバッグしているとき、エラー状態がどのように発生しているかを特定する必 要がある。
• データベーススキーマ、ナレッジベース、プログラムの配布を図式化して表現 したものを閲覧したい。
• リンクされたドキュメントの集まりの概観を見たい。
• 電話や電子メールのメッセージのデータベースからパターンや共通の関心を持 つコミュニティを発見したい。

このパッケージはコマンドラインツールを含みます。

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 は L-関数の零点や値を計算するプログラムです。対応している L-関数には、 リーマンゼータ関数、ラマヌジャンのデルタ関数の L-関数、有理数上に定義された 楕円曲線の L-関数があります。

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 は、単変数または多変数数学関数のインメモリツリー表現の作成 を可能とするプロシージャ群を含むライブラリで、作成した表現により変数の数値 を指定して関数の数値を評価したり、指定された変数についての導関数に対応する ツリーを作成したり、指定した文字列に対応するインメモリツリーをテキスト表現 で表示したりできます。任意の変数名の式中での使用、10 進定数、基本的な単項 演算子および二項演算子、初等数学関数をサポートします。

本パッケージにはランタイム共有ライブラリが含まれます。

線形計画法 (LP) は、次のように定式化されます: A.x >= V1 を V2.x を最小にして解く。A は行列、x は (正の値を持つ) ベクトル、 V1 は右辺値と呼ばれるベクトル、そして V2 は目標関数を指定するベクトルである。

整数線形計画法 (ILP) は全ての変数が整数であるという制限を持つ LP 問題である。 混合整数線形計画法 (MILP) では、変数のいくつかは整数、他の変数が実数である。

プログラム lp_solve は LP、ILP、そして MILP 問題を解きます。 上記で推奨されているよりもより汎用的であり、A の全ての列 (一つの拘束条件を 定義) は独自の等価性、すなわち <=、>= 又は = を持ち得ます。 結果は全ての変数に対する値を指定します。

lp_solve は 'Sumplex' アルゴリズムおよび純粋な LP 問題に対して疎行列法を利用 します。一つ又は複数の変数を整数として宣言すると、Simplex アルゴリズムは 望んだ最適解が見つかるまで branch and bound アルゴリズムを繰り返します。 lp_solve は 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.

凸多面体は、有限個の線形不等式を満たす点の集合です。このような系の頂点と 端射線の研究は、例えば数学と最適化理論においては重要かつ有用です。Dual interpretation では、(有界) 多面体の頂点を見つけることは、任意次元空間上 の点群の凸包 (境界不等式)を求めることと等価です。Lrs (辞書式逆検索) には、 特定のアプリケーションにとって非常に重要な 2 つの重要な機能があります。 すなわち、厳密に算術的であることと、出力がどんなに大きくなっても、入力に 比例したメモリしか消費しないことです。

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 は、対称正定値行列に特に焦点を当てた、大規模疎線形系の直接解法を 実装しています。例えばクラスタ間のような、分散行列を扱うことができます。 Fortran および C のインターフェースを持っています。また、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 は、自動三次元四面体メッシュジェネレータです。Constructive Solid Geometry (CSG) 又は STL ファイルフォーマットが由来の境界表現 (BRep) から 入力を受け取ります。NETGEN には、メッシュの最適化と階層的メッシュ改善用 モジュールが含まれます。

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 is a (mostly MATLAB® compatible) high-level language, primarily intended for numerical computations. It provides a convenient command-line interface for solving linear and nonlinear problems numerically.

Octave can be dynamically extended with user-supplied C++ files.

This package contains various tools to work with lattice polytopes:

• mori.x computes star triangulations of a polytope
• cws.x creates weight systems and combined weight systems
• class.x classifies reflexive polytopes
• poly.x computes data of a polytope
• nef.x computes Hodge numbers of nef-partitions

PARI/GP は、幅広く利用されている計算機代数システムであり、数論の高速計算 (因数分解、代数的数理論、楕円曲線など) のために設計さえています。 しかし、行列、多項式、級数、代数などの数学的要素の計算といった他の有用な 機能や、超越関数も多数含まれています。

もともとは、Henri Cohen と彼の同僚 (フランスのボルドー第一大学) により開発 されていましたが、PARI は、現在 GPL のもとで公開されており、多数のボランティア 開発者の助けを借りながら Karim Belabas により維持されています。

本パッケージには、GP 計算機が含まれます。

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 は、多面体についての計算を行うための自由な C ライブラリです。ベ クトル、行列、格子、多面体、Z 多面体、複数多面体の融合体およびその他の 中間構造を対象とする操作を行えます。これらの構造に対する重要な操作をす べて提供します。

このパッケージには、多面体の操作を実行するためのさまざまなユーティリティ が含まれています。

Proof General は、Emacs を対話型証明アシスタントにするメジャーモードで、 様々な定理証明系を用いて形式的数学証明を記述することができます。

このパッケージは、Coq に対する Proof General のサポートを提供します。 (他にまともにサポートできる証明アシスタントが存在していません。)

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.