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.

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

Now in its third edition, this highly successful textbook is widely regarded as the 'bible of computer algebra'.

First published in 1973 Professor Akensone(tm)s book traces the series of religious and political controversies which have battered the state schools of Northern Ireland. After the governmente(tm)s admirably intentioned, but muddled, attempt to create a non-sectarian school system in the early 1920s, the educational system was progressively manipulated by sectarianism. The way in which the author describes how children are schooled reveals a great deal about the attitudes and values of the parental generation and also helps to explain the actions of later generations.

Image algebra is a comprehensive, unifying theory of image transformations, image analysis, and image understanding. In 1996, the bestselling first edition of the Handbook of Computer Vision Algorithms in Image Algebra introduced engineers, scientists, and students to this powerful tool, its basic concepts, and its use in the concise representation

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 book focuses on advanced computer algebra methods and special functions that have striking applications in the context of quantum field theory. It presents the state of the art and new methods for (infinite) multiple sums, multiple integrals, in particular Feynman integrals, difference and differential equations in the format of survey articles. The presented techniques emerge from interdisciplinary fields: mathematics, computer science and theoretical physics; the articles are written by mathematicians and physicists with the goal that both groups can learn from the other field, including most recent developments. Besides that, the collection of articles also serves as an up-to-date handbook of available algorithms/software that are commonly used or might be useful in the fields of mathematics, physics or other sciences.

This thorough overview of the major computer algebra (symbolic mathematical) systems compares and contrasts their strengths and weaknesses, and gives tutorial information for using these systems in various ways. * Compares different packages quantitatively using standard 'test suites' * Ideal for assessing the most appropriate package for a particular user or application * Examines the performance and future developments from a user's and developer's viewpoint Internationally recognized specialists overview both the general and special purpose systems and discuss issues such as denesting nested roots, complex number calculations, efficiently computing special polynomials, solving single equations and systems of polynomial equations, computing limits, multiple integration, solving ordinary differential and nonlinear evolution equations, code generation, evaluation and computer algebra in education. The historical origins, computer algebra resources and equivalents for many common operations in seven major packages are also covered. By providing such a comprehensive survey, the experienced user is able to make an informed decision on which system(s) he or she might like to use. It also allows a user new to computer algebra to form an idea of where to begin. Since each system looked at in this book uses a different language, many examples are included to aid the user in adapting to these language differences. These examples can be used as a guide to using the various systems once one understands the basic principles of one CAS. The book also includes contributions which look at the broad issues of the needs of various users and future developments, both from the user's and the developer's viewpoint. The author is a leading figure in the development and analysis of mathematical software and is well known through the 'Wester test suite' of problems which provide a bench mark for measuring the performance of mathematical software systems. The book will help develop our range of titles for applied mathematcians. The book will provide a unique, fully up-to-date and independent assessment of particular systems and will be of interest to users and purchasers of CAS's.

This highly comprehensive handbook provides a substantial advance in the computation of elementary and special functions of mathematics, extending the function coverage of major programming languages well beyond their international standards, including full support for decimal floating-point arithmetic. Written with clarity and focusing on the C language, the work pays extensive attention to little-understood aspects of floating-point and integer arithmetic, and to software portability, as well as to important historical architectures. It extends support to a future 256-bit, floating-point format offering 70 decimal digits of precision. Select Topics and Features: references an exceptionally useful, author-maintained MathCW website, containing source code for the book’s software, compiled libraries for numerous systems, pre-built C compilers, and other related materials; offers a unique approach to covering mathematical-function computation using decimal arithmetic; provides extremely versatile appendices for interfaces to numerous other languages: Ada, C#, C++, Fortran, Java, and Pascal; presupposes only basic familiarity with computer programming in a common language, as well as early level algebra; supplies a library that readily adapts for existing scripting languages, with minimal effort; supports both binary and decimal arithmetic, in up to 10 different floating-point formats; covers a significant portion (with highly accurate implementations) of the U.S National Institute of Standards and Technology’s 10-year project to codify mathematical functions. This highly practical text/reference is an invaluable tool for advanced undergraduates, recording many lessons of the intermingled history of computer hardw are and software, numerical algorithms, and mathematics. In addition, professional numerical analysts and others will find the handbook of real interest and utility because it builds on research by the mathematical software community over the last four decades.

Abstract Biological vision is a rather fascinating domain of research. Scientists of various origins like biology, medicine, neurophysiology, engineering, math ematics, etc. aim to understand the processes leading to visual perception process and at reproducing such systems. Understanding the environment is most of the time done through visual perception which appears to be one of the most fundamental sensory abilities in humans and therefore a significant amount of research effort has been dedicated towards modelling and repro ducing human visual abilities. Mathematical methods play a central role in this endeavour. Introduction David Marr's theory v^as a pioneering step tov^ards understanding visual percep tion. In his view human vision was based on a complete surface reconstruction of the environment that was then used to address visual subtasks. This approach was proven to be insufficient by neuro-biologists and complementary ideas from statistical pattern recognition and artificial intelligence were introduced to bet ter address the visual perception problem. In this framework visual perception is represented by a set of actions and rules connecting these actions. The emerg ing concept of active vision consists of a selective visual perception paradigm that is basically equivalent to recovering from the environment the minimal piece information required to address a particular task of interest.