Paket: mandelbrot-solver (3.2.1-10.1 och andra)

[ Källkod: 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.

Andra paket besläktade med mandelbrot-solver

• dep: libc6 (>= 2.34)

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6-udeb

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

  Multiprecision polynomial solver (shared library)

• dep: libtcmalloc-minimal4t64 (>= 2.16)

  efficient thread-caching malloc

Hämta mandelbrot-solver

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Version	Paketstorlek	Installerad storlek	Filer
i386	3.2.1-10.1+b2	14,4 kbyte	46,0 kbyte	[filförteckning]