Computer algebra system
{{Short description|Mathematical software}}
{{Use dmy dates|date=April 2019|cs1-dates=y}}
{{Redirect|Symbolic algebra|the algebra of logic|Symbolical algebra}}
A computer algebra system (CAS) or symbolic algebra system (SAS) is any mathematical software with the ability to manipulate mathematical expressions in a way similar to the traditional manual computations of mathematicians and scientists. The development of the computer algebra systems in the second half of the 20th century is part of the discipline of "computer algebra" or "symbolic computation", which has spurred work in algorithms over mathematical objects such as polynomials.
Computer algebra systems may be divided into two classes: specialized and general-purpose. The specialized ones are devoted to a specific part of mathematics, such as number theory, group theory, or teaching of elementary mathematics.
General-purpose computer algebra systems aim to be useful to a user working in any scientific field that requires manipulation of mathematical expressions. To be useful, a general-purpose computer algebra system must include various features such as:
- a user interface allowing a user to enter and display mathematical formulas, typically from a keyboard, menu selections, mouse or stylus.
- a programming language and an interpreter (the result of a computation commonly has an unpredictable form and an unpredictable size; therefore user intervention is frequently needed),
- a simplifier, which is a rewrite system for simplifying mathematics formulas,
- a memory manager, including a garbage collector, needed by the huge size of the intermediate data, which may appear during a computation,
- an arbitrary-precision arithmetic, needed by the huge size of the integers that may occur,
- a large library of mathematical algorithms and special functions.
The library must not only provide for the needs of the users, but also the needs of the simplifier. For example, the computation of polynomial greatest common divisors is systematically used for the simplification of expressions involving fractions.
This large amount of required computer capabilities explains the small number of general-purpose computer algebra systems. Significant systems include Axiom, GAP, Maxima, Magma, Maple, Mathematica, and SageMath.
History
File:TI-Nspire.jpg calculator that contains a computer algebra system]]
In the 1950s, while computers were mainly used for numerical computations, there were some research projects into using them for symbolic manipulation. Computer algebra systems began to appear in the 1960s and evolved out of two quite different sources—the requirements of theoretical physicists and research into artificial intelligence.
A prime example for the first development was the pioneering work conducted by the later Nobel Prize laureate in physics Martinus Veltman, who designed a program for symbolic mathematics, especially high-energy physics, called Schoonschip (Dutch for "clean ship") in 1963. Other early systems include FORMAC.
Using Lisp as the programming basis, Carl Engelman created MATHLAB in 1964 at MITRE within an artificial-intelligence research environment. Later MATHLAB was made available to users on PDP-6 and PDP-10 systems running TOPS-10 or TENEX in universities. Today it can still be used on SIMH emulations of the PDP-10. MATHLAB ("mathematical laboratory") should not be confused with MATLAB ("matrix laboratory"), which is a system for numerical computation built 15 years later at the University of New Mexico.
In 1987, Hewlett-Packard introduced the first hand-held calculator CAS with the HP-28 series.{{cite web | title=Hewlett-Packard Calculator Firsts | first=Richard | last=Nelson | publisher=Hewlett-Packard | url=http://h20331.www2.hp.com/Hpsub/cache/392617-0-0-225-121.html | archive-url=https://web.archive.org/web/20100703031935/http://h20331.www2.hp.com/Hpsub/cache/392617-0-0-225-121.html | archive-date=2010-07-03}} Other early handheld calculators with symbolic algebra capabilities included the Texas Instruments TI-89 series and TI-92 calculator, and the Casio CFX-9970G.{{citation
| last = Coons | first = Albert
| date = October 1999
| department = Technology Tips
| doi = 10.5951/mt.92.7.0620
| issue = 7
| journal = The Mathematics Teacher
| jstor = 27971125
| pages = 620–622
| title = Getting started with symbolic mathematics systems: a productivity tool
| volume = 92}}
The first popular computer algebra systems were muMATH, Reduce, Derive (based on muMATH), and Macsyma; a copyleft version of Macsyma is called Maxima. Reduce became free software in 2008.{{Cite web |title=REDUCE Computer Algebra System at SourceForge |url=http://reduce-algebra.sourceforge.net |access-date=2015-09-28 |website=reduce-algebra.sourceforge.net}} Commercial systems include Mathematica[http://history.siam.org/oralhistories/gonnet.htm Interview with Gaston Gonnet, co-creator of Maple] {{webarchive|url=https://web.archive.org/web/20071229044836/http://history.siam.org/oralhistories/gonnet.htm|date=2007-12-29}}, SIAM History of Numerical Analysis and Computing, March 16, 2005. and Maple, which are commonly used by research mathematicians, scientists, and engineers. Freely available alternatives include SageMath (which can act as a front-end to several other free and nonfree CAS). Other significant systems include Axiom, GAP, Maxima and Magma.
The movement to web-based applications in the early 2000s saw the release of WolframAlpha, an online search engine and CAS which includes the capabilities of Mathematica.{{Cite news |last=Bhattacharya |first=Jyotirmoy |date=2022-05-12 |title=Wolfram{{!}}Alpha: a free online computer algebra system |language=en-IN |work=The Hindu |url=https://www.thehindu.com/sci-tech/technology/wolframalpha-a-free-online-computer-algebra-system/article65401003.ece |access-date=2023-04-26 |issn=0971-751X}}
More recently, computer algebra systems have been implemented using artificial neural networks, though as of 2020 they are not commercially available.{{Cite web |last=Ornes |first=Stephen |title=Symbolic Mathematics Finally Yields to Neural Networks |url=https://www.quantamagazine.org/symbolic-mathematics-finally-yields-to-neural-networks-20200520/ |access-date=2020-11-04 |website=Quanta Magazine |date=20 May 2020 |language=en}}
Symbolic manipulations
The symbolic manipulations supported typically include:
- simplification to a smaller expression or some standard form, including automatic simplification with assumptions and simplification with constraints
- substitution of symbols or numeric values for certain expressions
- change of form of expressions: expanding products and powers, partial and full factorization, rewriting as partial fractions, constraint satisfaction, rewriting trigonometric functions as exponentials, transforming logic expressions, etc.
- partial and total differentiation
- some indefinite and definite integration (see symbolic integration), including multidimensional integrals
- symbolic constrained and unconstrained global optimization
- solution of linear and some non-linear equations over various domains
- solution of some differential and difference equations
- taking some limits
- integral transforms
- series operations such as expansion, summation and products
- matrix operations including products, inverses, etc.
- statistical computation
- theorem proving and verification which is very useful in the area of experimental mathematics
- optimized code generation
In the above, the word some indicates that the operation cannot always be performed.
Additional capabilities
Many also include:
- a programming language, allowing users to implement their own algorithms
- arbitrary-precision numeric operations
- exact integer arithmetic and number theory functionality
- Editing of mathematical expressions in two-dimensional form
- plotting graphs and parametric plots of functions in two and three dimensions, and animating them
- drawing charts and diagrams
- APIs for linking it on an external program such as a database, or using in a programming language to use the computer algebra system
- string manipulation such as matching and searching
- add-ons for use in applied mathematics such as physics, bioinformatics, computational chemistry and packages for physical computation{{Cite journal |title=Computer Assisted Proofs and Automated Methods in Mathematics Education |first=Thierry Noah |last=Dana-Picard|journal=Electronic Proceedings in Theoretical Computer Science |date=2023 |volume=375 |pages=2–23 |doi=10.4204/EPTCS.375.2 |arxiv=2303.10166 }}
- solvers for differential equations{{Cite web|title=dsolve - Maple Programming Help|url=https://www.maplesoft.com/support/help/Maple/view.aspx?path=dsolve|website=www.maplesoft.com|access-date=2020-05-09}}{{Cite web|title=DSolve - Wolfram Language Documentation|url=https://reference.wolfram.com/language/ref/DSolve.html|website=www.wolfram.com|access-date=2020-06-28}}{{Cite web|title=Basic Algebra and Calculus — Sage Tutorial v9.0|url=http://doc.sagemath.org/html/en/tutorial/tour_algebra.html|website=doc.sagemath.org|access-date=2020-05-09}}{{Cite web|title=Symbolic algebra and Mathematics with Xcas|url=http://www-fourier.ujf-grenoble.fr/~parisse/giac/cascmd_en.pdf}}
Some include:
- graphic production and editing such as computer-generated imagery and signal processing as image processing
- sound synthesis
Some computer algebra systems focus on specialized disciplines; these are typically developed in academia and are free. They can be inefficient for numeric operations as compared to numeric systems.
Types of expressions
The expressions manipulated by the CAS typically include polynomials in multiple variables; standard functions of expressions (sine, exponential, etc.); various special functions (Γ, ζ, erf, Bessel functions, etc.); arbitrary functions of expressions; optimization; derivatives, integrals, simplifications, sums, and products of expressions; truncated series with expressions as coefficients, matrices of expressions, and so on. Numeric domains supported typically include floating-point representation of real numbers, integers (of unbounded size), complex (floating-point representation), interval representation of reals, rational number (exact representation) and algebraic numbers.
Use in education
There have been many advocates for increasing the use of computer algebra systems in primary and secondary-school classrooms. The primary reason for such advocacy is that computer algebra systems represent real-world math more than do paper-and-pencil or hand calculator based mathematics.{{cite web|url=http://www.ted.com/talks/conrad_wolfram_teaching_kids_real_math_with_computers?language=en|title=Teaching kids real math with computers|website=Ted.com|date=15 November 2010 |access-date=12 August 2017}}
This push for increasing computer usage in mathematics classrooms has been supported by some boards of education. It has even been mandated in the curriculum of some regions.{{cite web|url=http://www.edu.gov.mb.ca/k12/cur/math/outcomes/|title=Mathematics - Manitoba Education|website=Edu.gov.mb.ca|access-date=12 August 2017}}
Computer algebra systems have been extensively used in higher education.{{cite web|url=http://www.it.northwestern.edu/software/mathematica-fac/|title=Mathematica for Faculty, Staff, and Students : Information Technology - Northwestern University|website=It.northwestern.edu|access-date=12 August 2017}}{{cite web|url=https://cuit.columbia.edu/mathematica-students|title=Mathematica for Students - Columbia University Information Technology|website=cuit.columbia.edu|access-date=12 August 2017}} Many universities offer either specific courses on developing their use, or they implicitly expect students to use them for their course work. The companies that develop computer algebra systems have pushed to increase their prevalence among university and college programs.{{cite web|url=https://www.wolfram.com/solutions/education/higher-education/uses-for-education.html|title=Mathematica for Higher Education: Uses for University & College Courses|website=Wolfram.com|access-date=12 August 2017}}{{cite web|url=http://www.mathworks.com/academia/|title=MathWorks - Academia - MATLAB & Simulink|website=Mathworks.com|access-date=12 August 2017}}
CAS-equipped calculators are not permitted on the ACT, the PLAN, and in some classrooms[http://www.act.org/caap/sample/calc.html ACT's CAAP Tests: Use of Calculators on the CAAP Mathematics Test] {{webarchive |url=https://web.archive.org/web/20090831032437/http://www.act.org/caap/sample/calc.html |date=August 31, 2009 }} though it may be permitted on all of College Board's calculator-permitted tests, including the SAT, some SAT Subject Tests and the AP Calculus, Chemistry, Physics, and Statistics exams.{{cite web |title=AP Exams Calculator Policy |url=https://apstudents.collegeboard.org/exam-policies-guidelines/calculator-policies |website=AP Students |publisher=College Board |access-date=24 May 2024}}
Mathematics used in computer algebra systems
- Knuth–Bendix completion algorithm
- Root-finding algorithms{{cite book|author1=B. Buchberger|author2=G.E. Collins|author3=R. Loos|title=Computer Algebra: Symbolic and Algebraic Computation|url=https://books.google.com/books?id=yUmqCAAAQBAJ&q=%22algorithm%22|date=29 June 2013|publisher=Springer Science & Business Media|isbn=978-3-7091-3406-1}}
- Symbolic integration via e.g. Risch algorithm or Risch–Norman algorithm
- Hypergeometric summation via e.g. Gosper's algorithm
- Limit computation via e.g. Gruntz's algorithm
- Polynomial factorization via e.g., over finite fields,{{cite book|author1=Joachim von zur Gathen|author2=Jürgen Gerhard|title=Modern Computer Algebra|url=https://books.google.com/books?id=7fE9baKyqSEC&q=%22polynomial+factorization%22+%22finite+field%22|date=25 April 2013|publisher=Cambridge University Press|isbn=978-1-107-03903-2}} Berlekamp's algorithm or Cantor–Zassenhaus algorithm.
- Greatest common divisor via e.g. Euclidean algorithm
- Gaussian elimination{{cite book|author1=Keith O. Geddes|author2=Stephen R. Czapor|author3=George Labahn|title=Algorithms for Computer Algebra|url=https://books.google.com/books?id=9fOUwkkRxT4C|date=30 June 2007|publisher=Springer Science & Business Media|isbn=978-0-585-33247-5}}
- Gröbner basis via e.g. Buchberger's algorithm; generalization of Euclidean algorithm and Gaussian elimination
- Padé approximant
- Schwartz–Zippel lemma and testing polynomial identities
- Chinese remainder theorem
- Diophantine equations
- Landau's algorithm (nested radicals)
- Derivatives of elementary functions and special functions. (e.g. See derivatives of the incomplete gamma function.)
- Cylindrical algebraic decomposition
- Quantifier elimination over real numbers via cylindrical algebraic decomposition
See also
References
{{reflist}}
External links
- [http://www.ericdigests.org/2003-1/age.htm Curriculum and Assessment in an Age of Computer Algebra Systems] {{Webarchive|url=https://web.archive.org/web/20091201030924/http://www.ericdigests.org/2003-1/age.htm |date=2009-12-01 }} - From the Education Resources Information Center Clearinghouse for Science, Mathematics, and Environmental Education, Columbus, Ohio.
- Richard J. Fateman. "Essays in algebraic simplification." Technical report MIT-LCS-TR-095, 1972. (Of historical interest in showing the direction of research in computer algebra. At the MIT LCS website: [https://web.archive.org/web/20060917023934/http://www.lcs.mit.edu/publications/specpub.php?id=663])
{{Computer algebra systems}}
{{DEFAULTSORT:Computer Algebra System}}