Now in its third edition, this highly successful textbook is widely regarded as the 'bible of 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.

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.

The goal of Computer Algebra: Concepts and Techniques is to demystify computer algebra systems for a wide audience including students, faculty, and professionals in scientific fields such as computer science, mathematics, engineering, and physics. Unlike previous books, the only prerequisites are knowledge of first year calculus and a little programming experience — a background that can be assumed of the intended audience. The book is written in a lean and lively style, with numerous examples to illustrate the issues and techniques discussed. It presents the principal algorithms and data structures, while also discussing the inherent and practical limitations of these systems

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.

This book presents methods for the computational solution of some important problems of linear algebra: linear systems, linear least squares problems, eigenvalue problems, and linear programming problems. The book also includes a chapter on the fast Fourier transform and a very practical introduction to the solution of linear algebra problems on modern supercomputers. The book contains the relevant theory for most of the methods employed. It also emphasizes the practical aspects involved in implementing the methods. Students using this book will actually see and write programs for solving linear algebraic problems. Highly readable FORTRAN and MATLAB codes are presented which solve all of the main problems studied.