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의 GADT처럼 귀납적인 관계를 가지고 있지만, 유형이 아닌 단지 값에 의해서 인덱스될 수 있습니다. 모듈, mixfix 연산자, 유니코드 문자, 대화형 Emacs 인터페이스등을 매개변수화 합니다 (형식 검사기는 개발에 도움을 줄 수 있습니다).

Agda는 증명 보조자이기도 합니다: 증명 작성 및 확인을 위한 대화형 시스템입니다. Agda는 직관주의적 유형 이론을 기반으로 하며, 이 이론은 스웨덴 논리학자 Per Martin-Löf 가 개발한 건설 수학을 위한 기본 시스템입니다. Coq, Epigram, NuPRL 같은 종속 유형을 기반으로 하는 다른 증명 보조자와 많이 유사합니다.

이 패키지는 Agda의 이맥스 모드, 실행 파일, 표준 라이브러리, 문서를 제공하는 메타 패키지입니다.

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 is useful for research and development of mathematical algorithms. It defines a strongly typed, mathematically correct type hierarchy. It has a programming language and a built-in compiler.

Axiom has been in development since 1973 and was sold as a commercial product. It has been released as free software.

Efforts are underway to extend this software to (a) develop a better user interface (b) make it useful as a teaching tool (c) develop an algebra server protocol (d) integrate additional mathematics (e) rebuild the algebra in a literate programming style (f) integrate logic programming (g) develop an Axiom Journal with refereed submissions.

This package contains the main program binary and all precompiled algebra and autoloadable modules.

Bliss는 개별화 및 개선에 근거한, 자기동형 그룹 계산 및 그래프의 기본형을 위 한 역추적 알고리즘입니다. Bliss의 데이타 구조, 서브루틴, 그리고 pruning 휴 리스틱은 크고 드문 그래픽의 처리를 위해 특별히 설계되었습니다.

이 패키지는 명령행 도구 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는 미분 방정식의 자동화, 효율적 솔루션을 위한 자유 소프트웨어 모음입니다.

FEniCS는 가변 문제의 자동화 솔루션, 자동화된 오류 제어 및 적응성, 유한 요소의 포괄적 라이브러리, 고성능 선형 대수등을 포함한 광범위한 기능 목록을 가지고 있습니다.

FEniCS는 문제해결 환경 DOLFIN, 형식 컴파일러 FFC, 유한 요소 타블레이터 FIAT, Just-In-Time 컴파일러 Instant, 코드 생성 인터페이스 UFC, 형식 언어 UFL 및 다양한 추가 구성 요소를 포함한 상호 운용 가능한 콤포넌트의 모음으로 구성됩니다.

이는 모든 FEniCS 콤포넌트에 따라 달라지는 메타패키지입니다.

이는 FEniCS의 레거시 버전입니다. 차세대 FEniCS-X (fenicx 패키지) 설치를 고려할 수도 있습니다.

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.

이 패키지는 기호 조작 시스템입니다. 기호 표현을 파일에서 읽어 기호/대수 변 환을 실행합니다. 답은 문자 수학적 표현으로 반환됩니다. 랜드마크 기능으로 FORM에서 고려되는 표현식의 크기는 오직 가용한 디스크 공간에 의해서만 제약을 받으며, 가용한 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는 전산 그룹 이론을 특히 강조하는 전산 이산 대수학을 위한 시스템입니다. GAP은 대수 개체의 큰 데이타 라이브러리 뿐만 아니라, 프로그래밍 언어, GAP 언 어로 작성된 대수 알고리즘을 구현하는 수천의 함수 라이브러리를 제공합니다. GAP은 연구 그룹 및 그것에 대한 표현, 링, 벡터 공간, 대수, 조합 구조등을 위 한 연구 및 교육에 사용됩니다.

이 패키지는 표준 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.

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 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는 대상과 카메라를 각각 독립적으로 제어할 수 있습니다. Geomview는 움직임, (조명, 명암, 그리고 재료를 포함하는)외관, 오브젝트 선택, 구석 또는 정점 레벨, SGI 이미지 파일 또는 Renderman RIB 형식에서 snapshot, 그리고 마 우스의 직접 조작을 통해 제공되는 오브젝트 추가 또는 삭제, 페널 조종, 그리고 키보드 단축키등을 위해 쌍방향 제어를 제공합니다. 외부 프로그램은 뷰어외 모 든것을 쌍방향으로 제어하는 동안, 뷰어의 모양을 원하는데로 만들 수 있습니다 (위치의 변화를 계속적으로 로딩하거나, 특정 오브젝트의 외관를 제어하는 것과 같이).

Gerris는 유체 흐름을 설명하는 편미분 방정식의 해법을 위한 시스템입니다.

(현재의) 주요 기능에 대한 간단한 요약:

• 시간에 따른 비압축성 가변 밀도 오일러, 스톡스 또는 나비어-스톡스 방정식을 해결합니다
• 적응 메쉬 개선: 해상도가 흐름의 특성에 동적으로 적응됩니다
• 전적으로 복잡한 형상에서 자동 메쉬 생성
• 공간과 시간에서 2차
• 무제한 이류/확산 수동 추적자
• 추가 소스 용어의 유연한 사양
• MPI 라이브러리를 사용하는 포터블 병렬 지원
• 계면 흐름을 위한 유체 이류 스키마 볼륨

이 패키지에는 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 (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는 내장 CAD 엔진 및 후처리기 기능이 있는 3D 유한 요소 그리드 생성기입니 다. 개발 목적은 매개 변수 입력 및 고급 시각화 기능이 있는 빠르면서 경량인 사용자 친화적인 메싱 도구를 제공하는 것입니다. Gmsh는 4개의 모듈로 구성됩니 다: geometry, mesh, solver, post-processing. 이 모듈에 대한 임의 입력 항목 은 그래픽 사용자 인터페이스를 사용해서 대화식으로 하거나 또는 Gmsh의 자체 스크리팅 언어를 사용해서 ASCII 텍스트 파일로 할 수 있습니다.

Gmsh의 기능에 대해 더 자세한 개요는 Gmsh의 레퍼런스 메뉴얼을 보십시요.

Graph drawing addresses the problem of visualizing structural information by constructing geometric representations of abstract graphs and networks. Automatic generation of graph drawings has important applications in key technologies such as database design, software engineering, VLSI and network design and visual interfaces in other domains. Situations where these tools might be particularly useful include:

• you would like to restructure a program and first need to understand the relationships between its types, procedures, and source files
• you need to find the bottlenecks in an Internet backbone - not only individual links, but their relationships
• you're debugging a protocol or microarchitecture represented as a finite state machine and need to figure out how a certain error state arises
• you would like to browse a database schema, knowledge base, or distributed program represented graphically
• you would like to see an overview of a collection of linked documents
• you would like to discover patterns and communities of interest in a database of telephone calls or e-mail messages

This package contains the command-line tools.

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-함수의 0과 값을 계산하기 위한 프로그램입니다. 지원되는 L-함수로는 Riemann 제타 함수, Ramanujan 델타 함수의 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 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.

선형 계획 (LP) 문제는 다음과 같이 공식화 할 수 있습니다: 풀이 V2.x 최대값으로, A.x >= V1. A는 행렬이고, x는 (음이 아닌)변수로 구성된 벡터, V1은 우변으로 불리는 벡터, V2는 목적 함수를 지정하는 벡터입니다.

정수 선형 계획 (ILP) 문제는 모든 변수가 정수라는 제약 조건을 갖는 LP 입니다. 혼합 정수 선형 계획 (MILP) 문제에서 일부 변수는 정수이고 다른 변수는 실수입니다.

프로그램 lp_solve는 LP, ILP, MILP 문제를 해결합니다. A의 모든 행 (하나의 제약 조건 지정)은 자체 (비)균등, <=, >= 또는 =를 가질 수 있다는 점에서 위에서 제안한 것보다 약간 더 일반적입니다. 결과는 모든 변수에 대한 값을 지정합니다.

lp_solve는 순수 LP 문제에 대해 'Simplex' 알고리즘과 희소 행렬 방법을 사용합니다. 변수중 하나 이상이 정수로 선언되었 다면, 원하는 최적 솔루션을 찾을 때까지 Simplex 알고리즘은 분기 및 바인딩 알고리즘으로 반복됩니다. 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.

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은 수학 연산자 +, -, *, /, % (모듈러스), 거듭 제곱(근 포함)에 대한 대부분의 대수학 규칙을 구현합니다.

Mathomatic은 기호적으로 아래 사항을 수행할 수 있습니다:

• 방정식 결합, 해결,
• 식과 방정식을 완전히 단순화하고 비교,
• 간단한 미적분 변환과 계열을 수행,
• 표준, 복소수, 모듈러, 다항식 연산 수행,
• 단순화된 방정식에서 최적화된 C, Java, Python 언어 코드를 생성,
• 2차원 또는 3차원의 gnuplot을 사용한 플롯 표현식,
• 빠른 계산, 표현 색상화 등을 수행.

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.

MCL 패키지는 MCL 알고리즘의 구현이며, 그리고 희소 행렬(MCL 알고리즘에 필수적 자료 구조) 조작 및 클러스터 실을 위한 유틸리티를 제공합니다.

MCL는 현재 생물학(단백질 집단 검축, 유전체학)같은 과학, 컴퓨터 과학(P-to-P 네트웍스에서 노드 클러스트링), 그리고 언어학(텍스트 분석)에서 사용됩니다.

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.

Module Builder는 상미분 방정식 (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?)는 그래프와 이중음자의 자기동형 그룹을 계산하 기 위한 절차 세트입니다. 이 수학적 소프트웨어 제품은 Brendan McKay 와 Adolfo Piperno가 개발하였습니다: http://pallini.di.uniroma1.it

nauty는 일련의 생성자, 그룹의 크기, 그리고 그룹 궤도의 형태로 그래프 정보를 계산합니다; 정식 레이블을 생성할 수도 있습니다. nauty 제품은 C로 개발되었으 며 명령행 도구 및 어플리케이션 프로그래밍 인터페이스 (API)와 함께 제공됩니다.

이 패키지는 dreadnaut이라 불리는 nauty 인터페이스와 gtools라 불리는 작은 유 틸리티들의 모음도 제공합니다.

NETGEN is an automatic 3d tetrahedral mesh generator. It accepts input from constructive solid geometry (CSG) or boundary representation (BRep) from STL file format. NETGEN contains modules for mesh optimization and hierarchical mesh refinement.

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.

이 패키지는 격자 폴리토프 작업을 위한 여러가지 도구를 포함합니다:

• mori.x는 폴리토프의 별 삼각측량을 계산합니다
• cws.x는 중량 시스템과 결합된 중량 시스템을 생성합니다
• class.x는 반사 폴리토프를 분류합니다
• poly.x는 폴리토프의 데이타를 계산합니다
• nef.x는 nef 파티션의 Hodge 수를 계산합니다

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.