MPSolve (original) (raw)
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"
| Property | Value |
|---|---|
| dbo: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) |
| dbo:latestReleaseVersion | Version 3.1.5 |
| dbo:license | dbr:GPLv3 |
| dbo:programmingLanguage | dbr:C_(programming_language) |
| dbo:thumbnail | wiki-commons:Special:FilePath/Mcenter10.jpg?width=300 |
| dbo:wikiPageExternalLink | http://numpi.dm.unipi.it/software/mpsolve |
| dbo:wikiPageID | 13199350 (xsd:integer) |
| dbo:wikiPageLength | 3503 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1045506744 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Root-finding_algorithm dbr:GNU_Multi-Precision_Library dbr:GPLv3 dbr:GNU_Octave dbr:Gnuplot dbr:MATLAB dbr:Straight-line_program dbr:C_(programming_language) dbc:C_(programming_language)_software dbr:Graphical_user_interface dbc:Numerical_software dbr:Aberth_method dbr:Hooking dbr:Terminal_emulator dbr:Polynomial dbr:Sparse_matrix dbr:Filename_extension dbr:Command_line_interface dbr:Execution_(computers) dbr:Multiprecision dbr:File:Mcenter10.jpg |
| dbp:author | Dario Bini, Giuseppe Fiorentino, and Leonardo Robol (en) |
| dbp:genre | mathematical software (en) |
| dbp:language | English (en) |
| dbp:latestReleaseDate | April 2017 (en) |
| dbp:latestReleaseVersion | Version 3.1.5 (en) |
| dbp:license | dbr:GPLv3 |
| dbp:name | MPSolve (en) |
| dbp:operatingSystem | Linux, Windows, Mac OS X (en) |
| dbp:platform | PC (en) |
| dbp:programmingLanguage | dbr:C_(programming_language) |
| dbp:website | http://numpi.dm.unipi.it/software/mpsolve |
| dbp:wikiPageUsesTemplate | dbt:Infobox_software dbt:Reflist dbt:Short_description dbt:Wikibooks |
| dbp:wordnet_type | http://www.w3.org/2006/03/wn/wn20/instances/synset-software-noun-1 |
| dct:subject | dbc:C_(programming_language)_software dbc:Numerical_software |
| gold:hypernym | dbr:Package |
| rdf:type | owl:Thing dbo:Software schema:CreativeWork dbo:Work wikidata:Q386724 wikidata:Q7397 yago:Abstraction100002137 yago:Code106355894 yago:CodingSystem106353757 yago:Communication100033020 yago:Function113783816 yago:MathematicalRelation113783581 yago:Polynomial105861855 yago:Relation100031921 yago:Writing106359877 yago:WrittenCommunication106349220 yago:Software106566077 yago:WikicatPolynomials |
| 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) |
| rdfs:label | MPSolve (en) MPSolve (pl) |
| owl:sameAs | freebase:MPSolve yago-res:MPSolve wikidata:MPSolve dbpedia-pl:MPSolve https://global.dbpedia.org/id/4r2q5 |
| prov:wasDerivedFrom | wikipedia-en:MPSolve?oldid=1045506744&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Mcenter10.jpg |
| foaf:homepage | http://numpi.dm.unipi.it/software/mpsolve |
| foaf:isPrimaryTopicOf | wikipedia-en:MPSolve |
| foaf:name | MPSolve (en) |
| is dbo:wikiPageWikiLink of | dbr:Root-finding_algorithms dbr:Aberth_method dbr:System_of_polynomial_equations |
| is foaf:primaryTopic of | wikipedia-en:MPSolve |
