Computer algebra: Difference between revisions

Revision as of 19:43, 28 October 2020

Revision as of 18:06, 26 November 2020

Line 21:

There are several annual conferences on computer algebra, the premier being [[ISSAC]] (International Symposium on Symbolic and Algebraic Computation), which is regularly sponsored by SIGSAM.<ref>{{Cite web |url=http://www.sigsam.org/conferences/index.phtml |title=SIGSAM list of conferences |access-date=2012-11-15 |archive-url=https://web.archive.org/web/20130808052201/http://www.sigsam.org/conferences/index.phtml |archive-date=2013-08-08 |url-status=dead }}</ref>

There are several journals specializing in computer algebra, the top one being [[Journal of Symbolic Computation]] founded in 1985 by [[Bruno Buchberger]].<ref>{{cite book |title=Computer Algebra and Symbolic Computation: Mathematical Methods |url=https://archive.org/details/computeralgebras00cohe_792 |url-access=limited |last=Cohen |first=Joel S. | date = 2003 |publisher=AK Peters, Ltd. |___location= |isbn=978-1-56881-159-8 |page=[https://archive.org/details/computeralgebras00cohe_792/page/n33 14] }}</ref> There are also several other journals that regularly publish articles in computer algebra.<ref>[http://www.sigsam.org/journals.phtml SIGSAM list of journals]</ref>

== Computer science aspects ==

Line 39:

==== Expressions ====

[[File:Cassidy.1985.015.gif|thumb|400px|Representation of the expression (8-6)*(3+1) as a [[Lisp (programming language)|Lisp]] tree, from a 1985 Master's Thesis.<ref>{{cite thesis | type=Master's thesis | url=https://commons.wikimedia.org/wiki/File:The_feasibility_of_automatic_storage_reclamation_with_concurrent_program_execution_in_a_LISP_environment._(IA_feasibilityofaut00cass).pdf | author=Kevin G. Cassidy | title=The Feasibility of Automatic Storage Reclamation with Concurrent Program Execution in a LISP Environment | institution=Naval Postgraduate School, Monterey/CA | series= | volume= | date=Dec 1985 }} Here: p.15</ref>]]

Except for [[number]]s and [[variable (mathematics)|variables]], every [[Expression (mathematics)|mathematical expression]] may be viewed as the symbol of an operator followed by a [[sequence]] of operands. In computer algebra software, the expressions are usually represented in this way. This representation is very flexible, and many things that seem not to be mathematical expressions at first glance, may be represented and manipulated as such. For example, an equation is an expression with “=” as an operator, a matrix may be represented as an expression with “matrix” as an operator and its rows as operands.

Line 103:

*{{cite book|first1=James H.|last1=Davenport|author1-link=James H. Davenport|first2=Yvon|last2=Siret|first3=Èvelyne|last3=Tournier|title=Computer algebra: systems and algorithms for algebraic computation|others=Translated from the French by A. Davenport and J.H. Davenport|year=1988|publisher=Academic Press|isbn=978-0-12-204230-0}}

*{{cite book|first1=Joachim|last1=von zur Gathen|first2=Jürgen|last2=Gerhard|title=Modern computer algebra|edition=second|publisher=Cambridge University Press|year=2003|isbn = 0-521-82646-2}}

*{{Cite journal | last1 = Geddes | first1 = K. O. | last2 = Czapor | first2 = S. R. | last3 = Labahn | first3 = G. | doi = 10.1007/b102438 | title = Algorithms for Computer Algebra | year = 1992 | isbn = 978-0-7923-9259-0 | pmid = | pmc = | url-access = registration | url = https://archive.org/details/algorithmsforcom0000gedd }}

*{{Cite journal | editor1-last = Buchberger | editor1-first = Bruno | editor2-first = George Edwin | editor3-first = Rüdiger | editor4-first = Rudolf | doi = 10.1007/978-3-7091-7551-4 | title = Computer Algebra | series = Computing Supplementa | volume = 4 | year = 1983 | isbn = 978-3-211-81776-6 | pmid = | pmc = | editor2-last = Collins | editor3-last = Loos | editor4-last = Albrecht | url-access = registration | url = https://archive.org/details/computeralgebras0000unse }}

{{Computer science}}