Abstract
General principles of the construction and architecture of computer algebra systems are considered. The range of tasks that can be solved with their help is indicated. A classification of such systems is presented, and the most popular and significant packages for symbolic computing are listed. Fundamental characteristics of computer algebra systems, as well as data types, are mentioned. A difference between symbolic computations and numerical methods is emphasized. Two examples of algebraic calculations in the packages Maxima and GAP 4.2 are given. They are concerned with the solution of nonlinear algebraic systems and computations with subgroup lattices, respectively. Bibliography: 7 titles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
