Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.

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.

This easy-to-read book introduces the basics of solving partial differential equations by means of finite difference methods. Unlike many of the traditional academic works on the topic, this book was written for practitioners.

An introduction to some of the fundamental principles of computational geometry, concentrates on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems.

This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. It covers the basics of number theory, abstract algebra and discrete probability theory.

This book is a gentle introduction to SageMath for undergraduate students toward the end of Calculus or higher-level course work such as Multivariate Calculus, Differential Equations, Linear Algebra, or Math Modeling.

This is a textbook for an upper-level number theory course, with a clear vision to expose students to the connections to all areas of mathematics, and nearly every concept can be visualized or experimented with using the mathematics software SageMath.

This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. Many numerical examples are given throughout the book using the SageMath mathematical software.

This book aims to express properties of graphs in algebraic terms, then to deduce theorems about them. It tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix, using the SageMath.

This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. It's especially suitable for computer scientists and mathematicians interested in computational complexity.

This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation. It is also an exellent introduction to geometry concepts used in computer graphics, vision, robotics, geometric modeling.

This undergraduate textbook on Linear Algebra and n-Dimensional Geometry, in a self-teaching style, is invaluable for sophomore level undergraduates in mathematics, engineering, business, and the sciences.

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 monograph gives a self-contained detailed exposition of the algorithmic real algebraic geometry. It will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.

This book is dealing with a broad range of topics, ranging from algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic to computer algebra problems in quantum computing.

Anyone need to use algorithms in polynomials should have a copy of this! This is definitely one of the best! It covers almost everything anyone need in computation with systems of polynomial equations: Grobner Basis, Resultants, Characteristic Set, etc.

This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. It's especially suitable for computer scientists and mathematicians interested in computational complexity.

This book is intended as a text for a graduate course that focuses on applications of linear algebra and on the algorithms used to solve the problems that arise in those applications. Use matrix theory to understand the workings of the algorithms.

This book is designed to introduce students to the use of Linear Algebra to solve real-world problems. These materials were developed specifically for students and instructors that emphasizes hands-on problem-solving activities.

This book provides the mathematical fundamentals as well as algorithms for various shape interrogation methods including nonlinear polynomial solvers, intersection problems, differential geometry of intersection curves, distance functions etc.

LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. This book, written by the main authors of LEDA, is the definitive account of how the system operates and how it can be used.

This book is a unique approach and presentation, the author demonstrates how software can be used as a problem-solving tool for algebra. It includes many computations, both as examples and as exercises.

This book provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives.

This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field.

This book is designed as an introduction to Bayesian inference from a computational understanding-first, and mathematics-second, point of view. The book assumes no prior knowledge of Bayesian inference nor probabilistic programming.

This book shows you how to perform statistical analysis computationally, rather than mathematically, with programs written in Python.

This book presents algorithmic tools for algebraic geometry and experimental applications of them. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications.

This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves, with remarks on computer implementation. An extensive set of tables is provided giving the results of the author's implementation of the algorithms.

This is a textbook for a course in mathematical probability and statistics for computer science students.

This book covers many of the hottest area of useful new game theory research, introducing deep new problems, techniques, etc.

On one level, this is a collection of subroutines, in FORTRAN, for the solution of combinatorial problems.

It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.

This handbook cover the important subareas of computational statistics and give some flavor of the wide range of applications.

This book provides algorithms and ideas for computationalists, whether a working programmer or anyone interested in methods of computation.

This book is the most comprehensive collection of results on polygons currently available and thus earns its place as a standard text in computational geometry.

Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs.

This highly accessible introduction to Lisp is suitable both for novices approaching their first programming language and experienced programmers interested in exploring a key tool for artificial intelligence research.

This book introduces the concepts of functional and symbolic programming, applies these techniques to some problems of varying complexity.

This book describes a simple method for generating an endless succession of beautiful fractal patterns by iterating simple maps and ordinary differential equations with coefficients chosen automatically by the computer.