mpsolve 3.2.1-8 source package in Ubuntu
Changelog
mpsolve (3.2.1-8) unstable; urgency=medium * debian/control - Bump Standards-Version to 4.6.2. - Update Homepage URL. * debian/watch - Update download link. -- Doug Torrance <email address hidden> Tue, 20 Jun 2023 11:11:30 -0400
Upload details
- Uploaded by:
- Debian Math Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Math Team
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
mpsolve_3.2.1-8.dsc | 2.6 KiB | 58f473eef8775d121153ecb3b0c3ffb4e697326cccf17ab239b791e792569de6 |
mpsolve_3.2.1.orig.tar.bz2 | 3.1 MiB | 45b22f6b04544b9eda2457eec58580d892c7e00824ebd2d6e31fe24cdd763804 |
mpsolve_3.2.1-8.debian.tar.xz | 10.5 KiB | 5409b5b923c2969bb65e0df5531c244cee12f156c3f724f6a0cea6d462d11499 |
Available diffs
- diff from 3.2.1-7 to 3.2.1-8 (728 bytes)
No changes file available.
Binary packages built by this source
- libmps-dev: Multiprecision polynomial solver (development)
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
.
This package contains the development headers and the .so library of MPSolve.
- libmps-fortran-dev: Multiprecision polynomial solver (FORTRAN module development)
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
.
This package contains the module MPS that can be used to compile FORTRAN
programs using MPSolve.
- libmps-fortran0: Multiprecision polynomial solver (FORTRAN module)
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
.
This package contains the module MPS that can be used to call MPSolve from
FORTRAN programs.
- libmps-fortran0-dbgsym: debug symbols for libmps-fortran0
- libmps3: Multiprecision polynomial solver (shared library)
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
.
This package contains the libmps shared library of MPSolve.
- libmps3-dbgsym: debug symbols for libmps3
- mandelbrot-solver: Solver for Mandelbrot polynomials based on MPSolve
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
This binary, provided as an example of custom polynomial
implementation in the MPSolve package, uses the particular structure
of this family of polynomials to develop an efficient solver that
exhibit experimental O(n^2) complexity.
.
This package contains the specialization of mpsolve to Mandelbrot polynomials.
- mandelbrot-solver-dbgsym: debug symbols for mandelbrot-solver
- mpsolve: Multiprecision polynomial solver (command line version)
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
.
This package contains the command line version of MPSolve.
- mpsolve-dbgsym: debug symbols for mpsolve
- python3-mpsolve: Multiprecision polynomial solver (Python interface)
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
.
This package contains the Python interface to MPSolve.
- xmpsolve: Multiprecision polynomial solver (graphical version)
A polynomial rootfinder that can determine arbitrary precision approximations
with guaranteed inclusion radii.
It supports exploiting of polynomial structures such as sparsisty and allows
for polynomial implicitly defined or in some non standard basis.
.
This package contains the graphical version of MPSolve.
- xmpsolve-dbgsym: debug symbols for xmpsolve