MPSolve (Multiprecision Polynomial Solver) is a package for the approximation of the roots of a univariate polynomial. It uses the Aberth method, combined with a careful use of multiprecision. "Mpsolve takes advantage of sparsity, and has special hooks for polynomials that can be evaluated efficiently by straight-line programs"
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - MPSolve (en)
- MPSolve (pl)
|
rdfs:comment
| - MPSolve (Multiprecision Polynomial Solver) is a package for the approximation of the roots of a univariate polynomial. It uses the Aberth method, combined with a careful use of multiprecision. "Mpsolve takes advantage of sparsity, and has special hooks for polynomials that can be evaluated efficiently by straight-line programs" (en)
- MPSolve (ang. Multiprecision Polynomial Solver) – program do numerycznego obliczania miejsc zerowych wielomianów jednej zmiennej. Używa . Algorytm jest opisany w pracy: "Design, Analysis, and Implementation of a Multiprecision Polynomial Rootfinder" autorstwa D. A. Biniego oraz G. Fiorentino opublikowanej w Numerical Algorithms, numer 23 (2000), strony 127-173. Program został napisany w ANSI C i korzysta z GNU Multi-Precision Library.Dzięki wykorzystaniu biblioteki GMP pozwala na obliczanie zer wielomianów o bardzo dużym stopniu, np. 6400. (pl)
|
foaf:name
| |
foaf:homepage
| |
name
| |
foaf:depiction
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
thumbnail
| |
author
| - Dario Bini, Giuseppe Fiorentino, and Leonardo Robol (en)
|
genre
| - mathematical software (en)
|
language
| |
latest release date
| |
latest release version
| |
license
| |
operating system
| - Linux, Windows, Mac OS X (en)
|
platform
| |
programming language
| |
website
| |
has abstract
| - MPSolve (Multiprecision Polynomial Solver) is a package for the approximation of the roots of a univariate polynomial. It uses the Aberth method, combined with a careful use of multiprecision. "Mpsolve takes advantage of sparsity, and has special hooks for polynomials that can be evaluated efficiently by straight-line programs" (en)
- MPSolve (ang. Multiprecision Polynomial Solver) – program do numerycznego obliczania miejsc zerowych wielomianów jednej zmiennej. Używa . Algorytm jest opisany w pracy: "Design, Analysis, and Implementation of a Multiprecision Polynomial Rootfinder" autorstwa D. A. Biniego oraz G. Fiorentino opublikowanej w Numerical Algorithms, numer 23 (2000), strony 127-173. Program został napisany w ANSI C i korzysta z GNU Multi-Precision Library.Dzięki wykorzystaniu biblioteki GMP pozwala na obliczanie zer wielomianów o bardzo dużym stopniu, np. 6400. Pracuje w trybie konsoli, jest uruchamiany z linii komend. Program jest uruchamiany za pomocą polecenia unisolve (ang. univariate polynomial solver). Program wyświetla wyniki na ekranie lub zapisuje je do pliku, który może być wykorzystany do tworzenia wykresów za pomocą programu Gnuplot. (pl)
|
gold:hypernym
| |
dbp:wordnet_type
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
latest release version
| |
license
| |
programming language
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is foaf:primaryTopic
of | |