mpsolve 3.2.1-10.1build4 source package in Ubuntu

Changelog

mpsolve (3.2.1-10.1build4) noble; urgency=medium

  * No-change rebuild against libqt5core5t64

 -- Steve Langasek <email address hidden>  Fri, 12 Apr 2024 05:41:05 +0000

Upload details

Uploaded by:
Steve Langasek
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc
Noble release universe misc

Downloads

File Size SHA-256 Checksum
mpsolve_3.2.1.orig.tar.bz2 3.1 MiB 45b22f6b04544b9eda2457eec58580d892c7e00824ebd2d6e31fe24cdd763804
mpsolve_3.2.1-10.1build4.debian.tar.xz 11.2 KiB 0a2911c98d0747e60b47f9285dc91561840eaba77dfeb35530fed3f60810b556
mpsolve_3.2.1-10.1build4.dsc 2.7 KiB d1ebaca2a597ddb1ae0dc8df11697e3c593fd2362f43d1eeb6a5fa2d8751a1b5

View changes file

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-fortran0t64: 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-fortran0t64-dbgsym: debug symbols for libmps-fortran0t64
libmps3t64: 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.

libmps3t64-dbgsym: debug symbols for libmps3t64
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