Algorithms in algebraic geometry go hand in hand with software packages that implement them. Together they have established the modern field of computational algebraic geometry which has come to play a major role in both theoretical advances and applications. Over the past fifteen years, several excellent general purpose packages for computations in algebraic geometry have been developed, such as, CoCoA, Singular and Macaulay 2. While these packages evolve continuously, incorporating new mathematical advances, they both motivate and demand the creation of new mathematics and smarter algorithms. This volume reflects the workshop “Software for Algebraic Geometry” held in the week from 23 to 27 October 2006, as the second workshop in the thematic year on Applications of Algebraic Geometry at the IMA. The papers in this volume describe the software packages Bertini, PHClab, Gfan, DEMiCs, SYNAPS, TrIm, Gambit, ApaTools, and the application of Risa/Asir to a conjecture on multiple zeta values. They offer the reader a broad view of current trends in computational algebraic geometry through software development and applications.

This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.

A collection of surveys and research papers on mathematical software and algorithms. The common thread is that the field of mathematical applications lies on the border between algebra and geometry. Topics include polyhedral geometry, elimination theory, algebraic surfaces, Gröbner bases, triangulations of point sets and the mutual relationship. This diversity is accompanied by the abundance of available software systems which often handle only special mathematical aspects. This is why the volume also focuses on solutions to the integration of mathematical software systems. This includes low-level and XML based high-level communication channels as well as general frameworks for modular systems.

A quick guide to computing in algebraic geometry with many explicit computational examples introducing the computer algebra system Singular.

Until recently, almost all of the interactions between objects in virtual 3D worlds have been based on calculations performed using linear algebra. Linear algebra relies heavily on coordinates, however, which can make many geometric programming tasks very specific and complex-often a lot of effort is required to bring about even modest performance enhancements. Although linear algebra is an efficient way to specify low-level computations, it is not a suitable high-level language for geometric programming. Geometric Algebra for Computer Science presents a compelling alternative to the limitations of linear algebra. Geometric algebra, or GA, is a compact, time-effective, and performance-enhancing way to represent the geometry of 3D objects in computer programs. In this book you will find an introduction to GA that will give you a strong grasp of its relationship to linear algebra and its significance for your work. You will learn how to use GA to represent objects and perform geometric operations on them. And you will begin mastering proven techniques for making GA an integral part of your applications in a way that simplifies your code without slowing it down. * The first book on Geometric Algebra for programmers in computer graphics and entertainment computing * Written by leaders in the field providing essential information on this new technique for 3D graphics * This full colour book includes a website with GAViewer, a program to experiment with GA

This book is a guide to concepts and practice in numerical algebraic geometry ? the solution of systems of polynomial equations by numerical methods. Through numerous examples, the authors show how to apply the well-received and widely used open-source Bertini software package to compute solutions, including a detailed manual on syntax and usage options. The authors also maintain a complementary web page where readers can find supplementary materials and Bertini input files. Numerically Solving Polynomial Systems with Bertini approaches numerical algebraic geometry from a user's point of view with numerous examples of how Bertini is applicable to polynomial systems. It treats the fundamental task of solving a given polynomial system and describes the latest advances in the field, including algorithms for intersecting and projecting algebraic sets, methods for treating singular sets, the nascent field of real numerical algebraic geometry, and applications to large polynomial systems arising from differential equations. Those who wish to solve polynomial systems can start gently by finding isolated solutions to small systems, advance rapidly to using algorithms for finding positive-dimensional solution sets (curves, surfaces, etc.), and learn how to use parallel computers on large problems. These techniques are of interest to engineers and scientists in fields where polynomial equations arise, including robotics, control theory, economics, physics, numerical PDEs, and computational chemistry.

An accessible introduction to convex algebraic geometry and semidefinite optimization. For graduate students and researchers in mathematics and computer science.

The author defines “Geometric Algebra Computing” as the geometrically intuitive development of algorithms using geometric algebra with a focus on their efficient implementation, and the goal of this book is to lay the foundations for the widespread use of geometric algebra as a powerful, intuitive mathematical language for engineering applications in academia and industry. The related technology is driven by the invention of conformal geometric algebra as a 5D extension of the 4D projective geometric algebra and by the recent progress in parallel processing, and with the specific conformal geometric algebra there is a growing community in recent years applying geometric algebra to applications in computer vision, computer graphics, and robotics. This book is organized into three parts: in Part I the author focuses on the mathematical foundations; in Part II he explains the interactive handling of geometric algebra; and in Part III he deals with computing technology for high-performance implementations based on geometric algebra as a domain-specific language in standard programming languages such as C++ and OpenCL. The book is written in a tutorial style and readers should gain experience with the associated freely available software packages and applications. The book is suitable for students, engineers, and researchers in computer science, computational engineering, and mathematics.

This book provides a quick access to computational tools for algebraic geometry, the mathematical discipline which handles solution sets of polynomial equations. Originating from a number of intense one week schools taught by the authors, the text is designed so as to provide a step by step introduction which enables the reader to get started with his own computational experiments right away. The authors present the basic concepts and ideas in a compact way.

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.