Misplaced Pages

PARI/GP: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editContent deleted Content addedVisualWikitext
Revision as of 07:24, 13 December 2006 editSkyBoxx (talk | contribs)187 edits rvv← Previous edit Latest revision as of 15:40, 8 October 2024 edit undoBubba73 (talk | contribs)Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers93,168 editsm Reverted 2 edits by 5.228.82.251 (talk) to last revision by MichielNTags: Twinkle Undo 
(148 intermediate revisions by 84 users not shown)
Line 1: Line 1:
{{Short description|Computer algebra system}}
'''PARI/GP''' is a ] with the main aim of facilitating ] computations.
{{third-party|date=December 2013}}
As of July 2006, the stable version is 2.3.0 and the development version is 2.4.0. It is ] since Version 2.1.0 and is distributed under the terms of the ] as published by the ]. It runs on most common ]s.
{{Infobox software
| name = PARI/GP
| logo = PARI-GP logo.svg
| screenshot = PARI-GP-Windows-XP.png
| screenshot size = 248px
| caption = PARI/GP in use on ]
| developer = ], Karim Belabas, et al., at the ]
| latest release version = {{wikidata|property|preferred|references|edit|P348|P548=Q2804309}}
| latest release date = {{Start date and age|{{wikidata|qualifier|preferred|single|P348|P548=Q2804309|P577}}|df=yes}}
| latest preview version =
| latest preview date =
| programming language = ]
| operating_system = ]
| genre = ]
| license = ]
| website = {{URL|http://pari.math.u-bordeaux.fr/}}
}}


'''PARI/GP''' is a ] with the main aim of facilitating ] computations. Versions 2.1.0 and higher are distributed under the ]. It runs on most common ]s.
PARI/GP was originally developed in ] by a team led by ] at Laboratoire A2X and is now maintained by ] at the ] with the help of many volunteer contributors.


== System overview ==
The PARI system is a package that is capable of doing formal computations on recursive types at high speed. It is primarily aimed at number theorists, but can be used by anybody whose primary need is speed. It can be used to compute ]s, to perform ] computations and to perform ]. It also allows computations with ], ]s, ], ]s and implements many ].
The PARI/GP system is a package that is capable of doing formal computations on recursive types at high speed; it is primarily aimed at number theorists. Its three main strengths are its speed, the possibility of directly using ]s that are familiar to ]s, and its extensive algebraic number theory module.


The PARI/GP system consists of the following standard components:
Although quite an amount of symbolic manipulation is possible in PARI, the system does very badly compared to more sophisticated systems like ], ], ], ] or ] on such manipulations (e.g. ]s, ], and so on). On the other hand, the three main advantages of the system are its speed (which can be between 5 and 100 times better on many computations), the possibility of directly using ]s that are familiar to ]s, and its extensive algebraic number theory module, which has no equivalent in the above-mentioned systems.


* '''PARI''' is a ] ], allowing for fast computations, and which can be called from a high-level language application (for instance, written in C, ], ], ], ], or ]).
It is possible to use PARI in two different ways:
* '''gp''' is an easy-to-use interactive ] giving access to the PARI functions. It functions as a sophisticated programmable calculator which contains most of the control instructions of a standard language like C. '''GP''' is the name of ''gp''<nowiki>'</nowiki>s scripting language which can be used to program ''gp''.
# as a library, which can be called from an upper-level language application (for instance written in ], ], ]. ], ], or ]).
# as a sophisticated programmable calculator, named ''gp'', which contains most of the control instructions of a standard language like C. It can be programmed in a language called ''GP''.


Also available is '''gp2c''', the GP-to-C compiler, which compiles GP scripts into the C language and transparently loads the resulting functions into ''gp''. The advantage of this is that ''gp2c''-compiled scripts will typically run three to four times faster. ''gp2c'' understands almost all of GP.
Sample quick calculator usage:
? \p 200
realprecision = 202 significant digits (200 digits displayed)


PARI/GP performs ] calculations (e.g., the ] can be millions of digits long—and billions of digits on ] machines). It can compute ]s, perform ] computations and perform ] calculations. It also allows computations with ], ]s, ], ]s and implements many ].
? 123456! +0.0
time = 18,720 ms.
%33 = 2.604069904929137872951393056092656881827327040950301958461018557
9952057379676834157935607166171279087355200170616660008572612714566985893
730865282934317244121152865814030204645985573419251305342231136 E574964


PARI/GP comes with its own built-in graphical ] capability. PARI/GP has some symbolic manipulation capability, e.g., multivariate polynomial and rational function handling. It also has some formal ] and ] capabilities.
? sin(x)
time = 0 ms.
%34 = x - 1/6*x^3 + 1/120*x^5 - 1/5040*x^7 + 1/362880*x^9 - 1/39916800*x^11
+ 1/6227020800*x^13 - 1/1307674368000*x^15 + O(x^17)


PARI/GP can be compiled with ] (GNU Multiple Precision Arithmetic Library) providing faster computations than PARI/GP's native arbitrary-precision kernel.
? for(z=25,30, print (factor(2^z-1)))
time = 5 ms.


==External links== == History ==
PARI/GP's progenitor was a program named ''Isabelle'', an interpreter for ], written in 1979 by ] and ] at the ].<ref>{{cite journal |title=Le langage et l'interpréteur 'Isabelle', spécialement conçus pour utilisations arithmétiques |author=François Dress |journal=Séminaire de Théorie des Nombres de Bordeaux |volume=9 | at=exposé № 4 |year=1979–1980 |url=http://gdz.sub.uni-goettingen.de/dms/load/img/?PPN=PPN320141322_0009&DMDID=DMDLOG_0009&LOGID=LOG_0009&PHYSID=PHYS_0023}}</ref>
*
* at Karim Belabas homepage


PARI/GP was originally developed in 1985 by a team led by Henri Cohen at Laboratoire A2X and is now maintained by ] at the Université Bordeaux 1 with the help of many volunteer contributors.

=== Etymology ===
The name PARI is a pun about the project's early stages when the authors started to implement a library for "Pascal ARIthmetic" in the ] (although they quickly switched to ]), and after ''"pari de Pascal"'' (]).<ref name=trivia>"TRIVIA" section of 10 August 2004</ref>

The first version of the ''gp'' calculator was originally called GPC, for Great Programmable Calculator. The trailing C was eventually dropped.<ref name=trivia/>

== Usage examples ==
Below are some samples of the ''gp'' calculator usage:

<pre>
? \p 212
realprecision = 221 significant digits (212 digits displayed)
? (1.378-0.09143*I)^(14.87+0.3721*I)
time = 0 ms.
%1 = 80.817082637557070449383034933010288336925078193546211741027496566803185
11092579265743992920628314516739962724446042667886245322716456966120413965187
3272488827365261487845201056199035423784093096984005713791800191 - 94.8384618
89186304973351271821601500916571303364865064205039706592481303045713982306764
33264430511752515705768858710051382035377195497482934017239179757538824688799
0680136241031895212412150770309289450962931402933*I

? 123456! + 0. \\ slower than gamma(123457) which uses floating point
time = 1,656 ms.
%2 = 2.6040699049291378729513930560926568818273270409503019584610185579952057
37967683415793560716617127908735520017061666000857261271456698589373086528293
4317244121152865814030204645985573419251305342231135573491050756 E574964

? sin(x)
time = 0 ms.
%3 = x - 1/6*x^3 + 1/120*x^5 - 1/5040*x^7 + 1/362880*x^9 - 1/39916800*x^11
+ 1/6227020800*x^13 - 1/1307674368000*x^15 + O(x^17)

? for(z=25,30, print (factor(2^z-1)))
time = 5 ms.

? K = bnfinit(x^2 + 23); K.cyc
time = 1ms.
%4 =
/* This number field has class number 3. */
</pre>

== See also ==
{{Portal|Free and open-source software}}

* ], a multiple-software mathematical package which includes PARI/GP as one of its components
* ]

== References ==
{{reflist}}

== External links ==
*
* with a collection of references
*
* (sample programs)
* ; also in downloadable ]ped ] archive:
*
•
*

{{Computer algebra systems}}

{{DEFAULTSORT:Pari Gp}}
]
]
]
]
]
] ]
]
]

Latest revision as of 15:40, 8 October 2024

Computer algebra system
This article may rely excessively on sources too closely associated with the subject, potentially preventing the article from being verifiable and neutral. Please help improve it by replacing them with more appropriate citations to reliable, independent, third-party sources. (December 2013) (Learn how and when to remove this message)
PARI/GP
PARI/GP in use on Windows XP
Developer(s)Henri Cohen, Karim Belabas, et al., at the Université Bordeaux 1
Stable release2.15.5 Edit this on Wikidata / 23 February 2024; 9 months ago (23 February 2024)
Repository
Written inC
Operating systemCross-platform
TypeComputer algebra system
LicenseGNU General Public License
Websitepari.math.u-bordeaux.fr

PARI/GP is a computer algebra system with the main aim of facilitating number theory computations. Versions 2.1.0 and higher are distributed under the GNU General Public License. It runs on most common operating systems.

System overview

The PARI/GP system is a package that is capable of doing formal computations on recursive types at high speed; it is primarily aimed at number theorists. Its three main strengths are its speed, the possibility of directly using data types that are familiar to mathematicians, and its extensive algebraic number theory module.

The PARI/GP system consists of the following standard components:

  • PARI is a C library, allowing for fast computations, and which can be called from a high-level language application (for instance, written in C, C++, Pascal, Fortran, Perl, or Python).
  • gp is an easy-to-use interactive command line interface giving access to the PARI functions. It functions as a sophisticated programmable calculator which contains most of the control instructions of a standard language like C. GP is the name of gp's scripting language which can be used to program gp.

Also available is gp2c, the GP-to-C compiler, which compiles GP scripts into the C language and transparently loads the resulting functions into gp. The advantage of this is that gp2c-compiled scripts will typically run three to four times faster. gp2c understands almost all of GP.

PARI/GP performs arbitrary precision calculations (e.g., the significand can be millions of digits long—and billions of digits on 64-bit machines). It can compute factorizations, perform elliptic curve computations and perform algebraic number theory calculations. It also allows computations with matrices, polynomials, power series, algebraic numbers and implements many special functions.

PARI/GP comes with its own built-in graphical plotting capability. PARI/GP has some symbolic manipulation capability, e.g., multivariate polynomial and rational function handling. It also has some formal integration and differentiation capabilities.

PARI/GP can be compiled with GMP (GNU Multiple Precision Arithmetic Library) providing faster computations than PARI/GP's native arbitrary-precision kernel.

History

PARI/GP's progenitor was a program named Isabelle, an interpreter for higher arithmetic, written in 1979 by Henri Cohen and François Dress at the Université Bordeaux 1.

PARI/GP was originally developed in 1985 by a team led by Henri Cohen at Laboratoire A2X and is now maintained by Karim Belabas at the Université Bordeaux 1 with the help of many volunteer contributors.

Etymology

The name PARI is a pun about the project's early stages when the authors started to implement a library for "Pascal ARIthmetic" in the Pascal programming language (although they quickly switched to C), and after "pari de Pascal" (Pascal's Wager).

The first version of the gp calculator was originally called GPC, for Great Programmable Calculator. The trailing C was eventually dropped.

Usage examples

Below are some samples of the gp calculator usage: 

? \p 212
   realprecision = 221 significant digits (212 digits displayed)
? (1.378-0.09143*I)^(14.87+0.3721*I)
time = 0 ms.
%1 = 80.817082637557070449383034933010288336925078193546211741027496566803185
11092579265743992920628314516739962724446042667886245322716456966120413965187
3272488827365261487845201056199035423784093096984005713791800191 - 94.8384618
89186304973351271821601500916571303364865064205039706592481303045713982306764
33264430511752515705768858710051382035377195497482934017239179757538824688799
0680136241031895212412150770309289450962931402933*I
? 123456! + 0.    \\ slower than gamma(123457) which uses floating point
time = 1,656 ms.
%2 = 2.6040699049291378729513930560926568818273270409503019584610185579952057
37967683415793560716617127908735520017061666000857261271456698589373086528293
4317244121152865814030204645985573419251305342231135573491050756 E574964
? sin(x)
time = 0 ms.
%3 = x - 1/6*x^3 + 1/120*x^5 - 1/5040*x^7 + 1/362880*x^9 - 1/39916800*x^11
+ 1/6227020800*x^13 - 1/1307674368000*x^15 + O(x^17)
? for(z=25,30, print (factor(2^z-1)))
time = 5 ms.
? K = bnfinit(x^2 + 23); K.cyc
time = 1ms.
%4 = 
/* This number field has class number 3. */

See also

References

  1. "pari-2.15.5 (STABLE) released".
  2. François Dress (1979–1980). "Le langage et l'interpréteur 'Isabelle', spécialement conçus pour utilisations arithmétiques". Séminaire de Théorie des Nombres de Bordeaux. 9. exposé № 4.
  3. ^ "TRIVIA" section of "Manpage of GP," 10 August 2004

External links

• PARI/GP online calculator

Computer algebra systems
Open-source
Proprietary
Discontinued
Categories: