*A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.*

Skip to content
# Modern Computer Algebra

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.
# Modern Computer Algebra Third Edition

# Algorithms for Computer Algebra

Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.
# Computer Algebra Handbook

This Handbook gives a comprehensive snapshot of a field at the intersection of mathematics and computer science with applications in physics, engineering and education. Reviews 67 software systems and offers 100 pages on applications in physics, mathematics, computer science, engineering chemistry and education.
# Computer Algebra Recipes

This book presents a large number of computer algebra worksheets or "recipes" that have been designed using MAPLE to provide tools for problem solving and to stimulate critical thinking. No prior knowledge of MAPLE is necessary. All relevant commands are introduced on a need-to-know basis and are indexed for easy reference. Each recipe features a scientific model or method and an interesting or amusing story designed to both entertain and enhance concept comprehension and retention.
# Applications of Computer Algebra

Today, certain computer software systems exist which surpass the computational ability of researchers when their mathematical techniques are applied to many areas of science and engineering. These computer systems can perform a large portion of the calculations seen in mathematical analysis. Despite this massive power, thousands of people use these systems as a routine resource for everyday calculations. These software programs are commonly called "Computer Algebra" systems. They have names such as MACSYMA, MAPLE, muMATH, REDUCE and SMP. They are receiving credit as a computational aid with in creasing regularity in articles in the scientific and engineering literature. When most people think about computers and scientific research these days, they imagine a machine grinding away, processing numbers arithmetically. It is not generally realized that, for a number of years, computers have been performing non-numeric computations. This means, for example, that one inputs an equa tion and obtains a closed form analytic answer. It is these Computer Algebra systems, their capabilities, and applications which are the subject of the papers in this volume.
# Computer Algebra Systems

Book Description The book represents a library of well-designed software, which well supplements the already available Maple software with the orientation towards the widest circle of the Maple users, greatly enhancing its usability and effectiveness. The current library version contains tools (more than 570 procedures and program modules) that are oriented onto wide enough spheres of computing and information processing. The library is structurally similar to the main Maple library and is supplied with the advanced Help system about the tools located in it. In addition, the library is logically connected with the main Maple library, providing access to the tools contained in it similarly to the package tools. The library will be of special interest above all to those who use Maple of releases 6 - 9.5 not only as a highly intellectual calculator but also as environment for programming of different problems in own professional activities. The represented source codes of the library tools, using both the effective and the non-standard technique, can serve as an useful enough practical programming guide on the Maple language. Author Biography Professor Aladjev V. was born on June 14, 1942 in the town Grodno (Byelorussia). Now, he is the First vice-president of the International Academy of Noosphere and the president of Tallinn Research Group, whose scientific results have received international recognition, first, in the field of mathematical theory of Cellular Automata (CA). He is member of a series of Russian and International Academies. Aladjev V. is the author of more than 300 scientific publications, including 60 books, published in many countries. He participates as a member of the organizing committee and/or a guest lecturer in many international scientific forums in mathematics and cybernetics. Category: NonFiction/Science/Mathematics/Mathematical & Statistical Software/Algebra
# Intelligent Computer Mathematics

This book constitutes the joint refereed proceedings of the 9th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2008, the 15th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2008, and the 7th International Conference on Mathematical Knowledge Management, MKM 2008, held in Birmingham, UK, in July/August as CICM 2008, the Conferences on Intelligent Computer Mathematics. The 14 revised full papers for AISC 2008, 10 revised full papers for Calculemus 2008, and 18 revised full papers for MKM 2008, plus 5 invited talks, were carefully reviewed and selected from a total of 81 submissions for a joint presentation in the book. The papers cover different aspects of traditional branches in CS such as computer algebra, theorem proving, and artificial intelligence in general, as well as newly emerging ones such as user interfaces, knowledge management, and theory exploration, thus facilitating the development of integrated mechanized mathematical assistants that will be routinely used by mathematicians, computer scientists, and engineers in their every-day business.
# Polynomial Algorithms in Computer Algebra

For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it. Here, now, is the result of this work. Over the years many students have been helpful in improving the quality of the notes, and also several colleagues at Linz and elsewhere have contributed to it. I want to thank them all for their effort, in particular I want to thank B. Buchberger, who taught me the theory of Grabner bases nearly two decades ago, B. F. Caviness and B. D. Saunders, who first stimulated my interest in various problems in computer algebra, G. E. Collins, who showed me how to compute in algebraic domains, and J. R. Sendra, with whom I started to apply computer algebra methods to problems in algebraic geometry. Several colleagues have suggested improvements in earlier versions of this book. However, I want to make it clear that I am responsible for all remaining mistakes.
# Computer Algebra and Materials Physics

This book is intended as an introductory lecture in material physics, in which the modern computational group theory and the electronic structure calculation are in collaboration. The first part explains how to use computer algebra for applications in solid-state simulation, based on the GAP computer algebra package. Computer algebra enables us to easily obtain various group theoretical properties, such as the representations, character tables, and subgroups. Furthermore it offers a new perspective on material design, which could be executed in a mathematically rigorous and systematic way. The second part then analyzes the relation between the structural symmetry and the electronic structure in C60 (as an example of a system without periodicity). The principal object of the study was to illustrate the hierarchical change in the quantum-physical properties of the molecule, which correlates to the reduction in the symmetry (as it descends down in the ladder of subgroups). The book also presents the computation of the vibrational modes of the C60 by means of the computer algebra. In order to serve the common interests of researchers, the details of the computations (the required initial data and the small programs developed for the purpose) are explained in as much detail as possible.
# Rational Algebraic Curves

The central problem considered in this introduction for graduate students is the determination of rational parametrizability of an algebraic curve and, in the positive case, the computation of a good rational parametrization. This amounts to determining the genus of a curve: its complete singularity structure, computing regular points of the curve in small coordinate fields, and constructing linear systems of curves with prescribed intersection multiplicities. The book discusses various optimality criteria for rational parametrizations of algebraic curves.
# Quantum Mechanics Using Computer Algebra

Solving problems in quantum mechanics is an essential skill and research activity for scientists, engineers and others. Nowadays the labor of scientific computation has been greatly eased by the advent of computer algebra packages. These do not merely perform number-crunching tasks, but enable users to manipulate algebraic expressions and equations symbolically. For example, differentiation and integration can now be carried out algebraically by the computer.This book collects standard and advanced methods in quantum mechanics and implements them using REDUCE, a popular computer algebra package. Throughout, sample programs and their output have been displayed alongside explanatory text, making the book easy to follow. Selected problems have also been implemented using two other popular packages, MATHEMATICA and MAPLE, and in the object-oriented programming language C++.Besides standard quantum mechanical techniques, modern developments in quantum theory are also covered. These include Fermi and Bose Operators, coherent states, gauge theory and quantum groups. All the special functions relevant to quantum mechanics (Hermite, Chebyshev, Legendre and more) are implemented.The level of presentation is such that one can get a sound grasp of computational techniques early on in one's scientific education. A careful balance is struck between practical computation and the underlying mathematical concepts, making the book well-suited for use with quantum mechanics courses.
# CryptoSchool

This book offers an introduction to cryptology, the science that makes secure communications possible, and addresses its two complementary aspects: cryptography—--the art of making secure building blocks—--and cryptanalysis—--the art of breaking them. The text describes some of the most important systems in detail, including AES, RSA, group-based and lattice-based cryptography, signatures, hash functions, random generation, and more, providing detailed underpinnings for most of them. With regard to cryptanalysis, it presents a number of basic tools such as the differential and linear methods and lattice attacks. This text, based on lecture notes from the author’s many courses on the art of cryptography, consists of two interlinked parts. The first, modern part explains some of the basic systems used today and some attacks on them. However, a text on cryptology would not be complete without describing its rich and fascinating history. As such, the colorfully illustrated historical part interspersed throughout the text highlights selected inventions and episodes, providing a glimpse into the past of cryptology. The first sections of this book can be used as a textbook for an introductory course to computer science or mathematics students. Other sections are suitable for advanced undergraduate or graduate courses. Many exercises are included. The emphasis is on providing reasonably complete explanation of the background for some selected systems.
# Computer Algebra in Scientific Computing

This book constitutes the refereed proceedings of the 12th International Workshop on Computer Algebra in Scientific Computing, CASC 2010, held in Tsakhadzor, Armenia, in September 2010. The book includes two invited talks and an abstract in addition to 23 full papers.
# MuPAD Tutorial

This book explains the basic use of the software package called MuPAD and gives an insight into the power of the system. MuPAD is a so-called com puter algebra system, which is developed mainly by Sciface Software and the MuPAD Research Group of the University of Paderborn in Germany. This introduction addresses mathematicians, engineers, computer scientists, natural scientists and, more generally, all those in need of mathematical com putations for their education or their profession. Generally speaking, this book addresses anybody who wants to use the power of a modern computer algebra package. There are two ways to use a computer algebra system. On the one hand, you may use the mathematical knowledge it incorporates by calling system functions interactively. For example, you can compute symbolic integrals or generate and invert matrices by calling appropriate functions. They comprise the system's mathematical intelligence and may implement sophisticated al gorithms. Chapters 2 through 15 discuss this way of using MuPAD. On the other hand, with the help of MuPAD's programming language, you can easily add functionality to the system by implementing your own algorithms as MuPAD procedures. This is useful for special purpose applications if no ap propriate system functions exist. Chapters 16 through 18 are an introduction to programming in MuPAD.
# Modern Computer Arithmetic

Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favourite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions to selected exercises are available from the authors.
# RUDIMENTS OF MODERN COMPUTER APPLICATION

# Computer Algebra Recipes for Classical Mechanics

This is a standalone, but the recipes are correlated with topics found in standard texts, and make use of MAPLE (Release 7). As a reference text, or self-study guide this book is useful for science professionals and engineers.; Good for the classroom correlates with topics found in standard classical mechanics texts.; This book makes use of the powerful computer algebra system MAPLE (Release 7) but no prior knowledge of MAPLE is presumed.; The relevant command structures are explained on a need-to-know basis as the recipes are developed, thus making this a standalone text.
# Relativity and Scientific Computing

For this set of lectures we assumed that the reader has a reasonable back ground in physics and some knowledge of general relativity, the modern theory of gravity in macrophysics, and cosmology. Computer methods are present ed by leading experts in the three main domains: in numerics, in computer algebra, and in visualization. The idea was that each of these subdisciplines is introduced by an extended set of main lectures and that each is conceived as being of comparable 'importance. Therefpre we believe that the book represents a good introduction into scientific I computing for any student who wants to specialize in relativity, gravitation, and/or astrophysics. We took great care to select lecturers who teach in a comprehensible way and who are, at the same time, at the research front of their respective field. In numerics we had the privilege of having a lecturer from the National Center for Supercomputing Applications (NCSA, Champaign, IL, USA) and some from other leading institutions of the world; visualization was taught by a visualization expert from Boeing; and in com puter algebra we took recourse to practitioners of different computer algebra systems as applied to classical general relativity up to quantum gravity and differential geometry.
# Computer Algebra and Parallelism

This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr|bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors.