Paketti: mandelbrot-solver (3.2.1-10.1 ja muut)

[ Source: mpsolve  ]

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.

Muut pakettiin mandelbrot-solver liittyvät paketit

• dep: libc6 (>= 2.34)

  GNU-C-kirjasto: jaetut kirjastot
  myös näennäispaketti, jonka toteuttaa libc6-udeb

• dep: libmps3t64 (= 3.2.1-10.1+b1)

  Multiprecision polynomial solver (shared library)

• dep: libtcmalloc-minimal4t64 (>= 2.15)

  efficient thread-caching malloc

Imuroi mandelbrot-solver

Imurointi kaikille saataville arkkitehtuureille

Arkkitehtuuri	Versio	Paketin koko	Koko asennettuna	Tiedostot
amd64	3.2.1-10.1+b1	13.6 kt	43.0 kt	[tiedostoluettelo]