Mathematica, Maple, and similar software packages provide programs that carry out sophisticated mathematical operations. Applying the ideas introduced in Computer Algebra and Symbolic Computation: Elementary Algorithms, this book explores the application of algorithms to such methods as automatic simplification, polynomial decomposition, and polyno

This book provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages. The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and

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.

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.

Geosciences particularly numerical weather predication, are demanding the highest levels of computer power available. The European Centre for Medium-Range Weather Forecasts, with its experience in using supercomputers in this field, organizes a workshop every other year bringing together manufacturers, computer scientists, researchers and operational users to share their experiences and to learn about the latest developments. This volume provides an excellent overview of the latest achievements and plans for the use of new parallel techniques in the fields of meteorology, climatology and oceanography.

This first volume in the series "Algorithms and Computation in Mathematics", is destined to become the standard reference work in the field. Manuel Bronstein is the number-one expert on this topic and his book is the first to treat the subject both comprehensively and in sufficient detail - incorporating new results along the way. The book addresses mathematicians and computer scientists interested in symbolic computation, developers and programmers of computer algebra systems as well as users of symbolic integration methods. Many algorithms are given in pseudocode ready for immediate implementation, making the book equally suitable as a textbook for lecture courses on symbolic integration.

Mathematics for Physical Science and Engineering is a complete text in mathematics for physical science that includes the use of symbolic computation to illustrate the mathematical concepts and enable the solution of a broader range of practical problems. This book enables professionals to connect their knowledge of mathematics to either or both of the symbolic languages Maple and Mathematica. The book begins by introducing the reader to symbolic computation and how it can be applied to solve a broad range of practical problems. Chapters cover topics that include: infinite series; complex numbers and functions; vectors and matrices; vector analysis; tensor analysis; ordinary differential equations; general vector spaces; Fourier series; partial differential equations; complex variable theory; and probability and statistics. Each important concept is clarified to students through the use of a simple example and often an illustration. This book is an ideal reference for upper level undergraduates in physical chemistry, physics, engineering, and advanced/applied mathematics courses. It will also appeal to graduate physicists, engineers and related specialties seeking to address practical problems in physical science. - Clarifies each important concept to students through the use of a simple example and often an illustration - Provides quick-reference for students through multiple appendices, including an overview of terms in most commonly used applications (Mathematica, Maple) - Shows how symbolic computing enables solving a broad range of practical problems