Binary package “mandelbrot-solver” in ubuntu noble
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.
Source package
Published versions
- mandelbrot-solver 3.2.1-9 in amd64 (Release)
- mandelbrot-solver 3.2.1-10.1build4 in amd64 (Proposed)
- mandelbrot-solver 3.2.1-10.1build4 in amd64 (Release)
- mandelbrot-solver 3.2.1-9 in arm64 (Release)
- mandelbrot-solver 3.2.1-10.1build4 in arm64 (Proposed)
- mandelbrot-solver 3.2.1-10.1build4 in arm64 (Release)
- mandelbrot-solver 3.2.1-9 in armhf (Release)
- mandelbrot-solver 3.2.1-10.1build4 in armhf (Proposed)
- mandelbrot-solver 3.2.1-10.1build4 in armhf (Release)
- mandelbrot-solver 3.2.1-9 in ppc64el (Release)
- mandelbrot-solver 3.2.1-10.1build4 in ppc64el (Proposed)
- mandelbrot-solver 3.2.1-10.1build4 in ppc64el (Release)
- mandelbrot-solver 3.2.1-9 in riscv64 (Release)
- mandelbrot-solver 3.2.1-10.1build4 in riscv64 (Proposed)
- mandelbrot-solver 3.2.1-10.1build4 in riscv64 (Release)
- mandelbrot-solver 3.2.1-9 in s390x (Release)
- mandelbrot-solver 3.2.1-10.1build4 in s390x (Proposed)
- mandelbrot-solver 3.2.1-10.1build4 in s390x (Release)