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

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 favorite 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 are available from the authors.

Advanced algebra in the service of contemporary mathematicalresearch-- a unique introduction. This volume takes an altogether new approach to advanced algebra.Its intriguing title, inspired by the term postmodernism, denotes adeparture from van der Waerden's Modern Algebra--a book that hasdominated the field for nearly seventy years. Post-Modern Algebraoffers a truly up-to-date alternative to the standard approach,explaining topics from an applications-based perspective ratherthan by abstract principles alone. The book broadens the field ofstudy to include algebraic structures and methods used in currentand emerging mathematical research, and describes the powerful yetsubtle techniques of universal algebra and category theory.Classical algebraic areas of groups, rings, fields, and vectorspaces are bolstered by such topics as ordered sets, monoids,monoid actions, quasigroups, loops, lattices, Boolean algebras,categories, and Heyting algebras. The text features: * A clear and concise treatment at an introductory level, tested inuniversity courses. * A wealth of exercises illustrating concepts and their practicalapplication. * Effective techniques for solving research problems in the realworld. * Flexibility of presentation, making it easy to tailor material tospecific needs. * Help with elementary proofs and algebraic notations for studentsof varying abilities. Post-Modern Algebra is an excellent primary or supplementary textfor graduate-level algebra courses. It is also an extremely usefulresource for professionals and researchers in many areas who musttackle abstract, linear, or universal algebra in the course oftheir work.