Fermat (computer algebra system) (original) (raw)
Fermat (named after Pierre de Fermat) is a freeware program developed by Prof. Robert H. Lewis of Fordham University. It is a computer algebra system, in which items being computed can be integers (of arbitrary size), rational numbers, real numbers, complex numbers, modular numbers, finite field elements, multivariable polynomials, rational functions, or polynomials modulo other polynomials. The main areas of application are multivariate rational function arithmetic and matrix algebra over rings of multivariate polynomials or rational functions. Fermat does not do simplification of transcendental functions or symbolic integration.
| Property | Value |
|---|---|
| dbo:abstract | Fermat (named after Pierre de Fermat) is a freeware program developed by Prof. Robert H. Lewis of Fordham University. It is a computer algebra system, in which items being computed can be integers (of arbitrary size), rational numbers, real numbers, complex numbers, modular numbers, finite field elements, multivariable polynomials, rational functions, or polynomials modulo other polynomials. The main areas of application are multivariate rational function arithmetic and matrix algebra over rings of multivariate polynomials or rational functions. Fermat does not do simplification of transcendental functions or symbolic integration. A session with Fermat usually starts by choosing rational or modular "mode" to establish the ground field (or ground ring) as or . On top of this may be attached any number of symbolic variables thereby creating the polynomial ring and its quotient field. Further, some polynomials involving some of the can be chosen to mod out with, creating the quotient ring Finally, it is possible to allow Laurent polynomials, those with negative as well as positive exponents. Once the computational ring is established in this way, all computations are of elements of this ring. The computational ring can be changed later in the session. The polynomial gcd procedures, which call each other in a highly recursive manner, are about 7000 lines of code. Fermat has extensive built-in primitives for array and matrix manipulations, such as submatrix, sparse matrix, determinant, normalize, column reduce, row echelon, Smith normal form, and matrix inverse. It is consistently faster than some well known computer algebra systems, especially in multivariate polynomial gcd. It is also space efficient. The basic data item in Fermat is a multivariate rational function or quolynomial. The numerator and denominator are polynomials with no common factor. Polynomials are implemented recursively as general linked lists, unlike some systems that implement polynomials as lists of monomials. To implement (most) finite fields, the user finds an irreducible monic polynomial in a symbolic variable, say and commands Fermat to mod out by it. This may be continued recursively, etc. Low level data structures are set up to facilitate arithmetic and gcd over this newly created ground field. Two special fields, and are more efficiently implemented at the bit level. (en) |
| dbo:genre | dbr:Computer_algebra_system |
| dbo:latestReleaseDate | 2021-06-25 (xsd:date) |
| dbo:latestReleaseVersion | 6.5 |
| dbo:license | dbr:GPL dbr:Freeware |
| dbo:programmingLanguage | dbr:C_(programming_language) |
| dbo:wikiPageExternalLink | http://home.bway.net/lewis/fferm.html https://fordham.academia.edu/RobertLewis/ http://home.bway.net/lewis http://home.bway.net/lewis/wferm.html |
| dbo:wikiPageID | 4982431 (xsd:integer) |
| dbo:wikiPageLength | 5391 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1121496787 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Monomial dbr:Determinant dbr:Unix dbr:VAX dbr:Symbolic_integration dbr:Quotient_ring dbr:Complex_number dbr:Matrix_algebra dbr:Matrix_inverse dbr:Classic_Mac_OS dbr:GPL dbr:Modular_arithmetic dbr:Linux dbr:MacOS dbr:Computer_algebra_system dbr:C_(programming_language) dbr:Laurent_polynomial dbc:C_(programming_language)_software dbr:Field_(mathematics) dbr:Finite_field dbr:Fordham_University dbr:Normal_matrix dbr:Pascal_(programming_language) dbr:Floating_point dbr:Source_code dbr:Rational_function dbr:Ring_(mathematics) dbc:Computer_algebra_systems dbc:Proprietary_freeware_for_Linux dbr:Digital_Equipment_Corporation dbc:Computer_algebra_system_software_for_Linux dbr:Pierre_de_Fermat dbr:Polynomial dbr:Polynomial_ring dbr:Sparse_matrix dbr:Freeware dbr:Ground_field dbr:Greatest_common_divisor_of_two_polynomials dbr:Integer dbr:Microsoft_Windows dbr:Rational_number dbr:Real_number dbr:Smith_normal_form dbr:Multivariate_polynomial dbr:Porting dbr:Transcendental_function dbr:Submatrix dbr:Row_echelon dbr:Comparison_of_computer_algebra_systems |
| dbp:developer | Robert H. Lewis (en) |
| dbp:genre | dbr:Computer_algebra_system |
| dbp:latestReleaseDate | 2021-06-25 (xsd:date) |
| dbp:latestReleaseVersion | 6.500000 (xsd:double) |
| dbp:license | 0001-08-04 (xsd:gMonthDay) |
| dbp:name | Fermat (en) |
| dbp:operatingSystem | dbr:Unix dbr:Classic_Mac_OS dbr:Linux dbr:MacOS dbr:Microsoft_Windows |
| dbp:programmingLanguage | dbr:C_(programming_language) |
| dbp:wikiPageUsesTemplate | dbt:Infobox_Software dbt:Official_website dbt:Short_description dbt:Start_date_and_age dbt:URL dbt:Unsourced dbt:Use_dmy_dates dbt:Computer_algebra_systems |
| dbp:wordnet_type | http://www.w3.org/2006/03/wn/wn20/instances/synset-software-noun-1 |
| dct:subject | dbc:C_(programming_language)_software dbc:Computer_algebra_systems dbc:Proprietary_freeware_for_Linux dbc:Computer_algebra_system_software_for_Linux |
| rdf:type | owl:Thing dbo:Software schema:CreativeWork dbo:Work wikidata:Q386724 wikidata:Q7397 yago:Abstraction100002137 yago:Code106355894 yago:CodingSystem106353757 yago:Communication100033020 yago:Writing106359877 yago:WrittenCommunication106349220 yago:Software106566077 umbel-rc:SoftwareObject |
| rdfs:comment | Fermat (named after Pierre de Fermat) is a freeware program developed by Prof. Robert H. Lewis of Fordham University. It is a computer algebra system, in which items being computed can be integers (of arbitrary size), rational numbers, real numbers, complex numbers, modular numbers, finite field elements, multivariable polynomials, rational functions, or polynomials modulo other polynomials. The main areas of application are multivariate rational function arithmetic and matrix algebra over rings of multivariate polynomials or rational functions. Fermat does not do simplification of transcendental functions or symbolic integration. (en) |
| rdfs:label | Fermat (computer algebra system) (en) |
| owl:sameAs | freebase:Fermat (computer algebra system) wikidata:Fermat (computer algebra system) dbpedia-sr:Fermat (computer algebra system) https://global.dbpedia.org/id/4jPKw |
| prov:wasDerivedFrom | wikipedia-en:Fermat_(computer_algebra_system)?oldid=1121496787&ns=0 |
| foaf:homepage | http://home.bway.net/lewis/ |
| foaf:isPrimaryTopicOf | wikipedia-en:Fermat_(computer_algebra_system) |
| foaf:name | Fermat (en) |
| is dbo:wikiPageRedirects of | dbr:Fermat_computer_algebra_system |
| is dbo:wikiPageWikiLink of | dbr:List_of_computer_algebra_systems dbr:Fermat_computer_algebra_system dbr:List_of_things_named_after_Pierre_de_Fermat |
| is foaf:primaryTopic of | wikipedia-en:Fermat_(computer_algebra_system) |