Thirty years ago mathematical, as opposed to applied numerical, computation was difficult to perform and so relatively little used. Three threads changed that: the emergence of the personal computer; the discovery of fiber-optics and the consequent development of the modern internet; and the building of the Three “M’s” Maple, Mathematica and Matlab. We intend to persuade that Mathematica and other similar tools are worth knowing, assuming only that one wishes to be a mathematician, a mathematics educator, a computer scientist, an engineer or scientist, or anyone else who wishes/needs to use mathematics better. We also hope to explain how to become an "experimental mathematician" while learning to be better at proving things. To accomplish this our material is divided into three main chapters followed by a postscript. These cover elementary number theory, calculus of one and several variables, introductory linear algebra, and visualization and interactive geometric computation.

This unique book provides a comprehensive introduction to computational mathematics, which forms an essential part of contemporary numerical algorithms, scientific computing and optimization. It uses a theorem-free approach with just the right balance between mathematics and numerical algorithms. This edition covers all major topics in computational mathematics with a wide range of carefully selected numerical algorithms, ranging from the root-finding algorithm, numerical integration, numerical methods of partial differential equations, finite element methods, optimization algorithms, stochastic models, nonlinear curve-fitting to data modelling, bio-inspired algorithms and swarm intelligence. This book is especially suitable for both undergraduates and graduates in computational mathematics, numerical algorithms, scientific computing, mathematical programming, artificial intelligence and engineering optimization. Thus, it can be used as a textbook and/or reference book.

This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing the mathematical tools needed for the construction and security analysis of diverse cryptosystems. Only basic linear algebra is required of the reader; techniques from algebra, number theory, and probability are introduced and developed as required. This text provides an ideal introduction for mathematics and computer science students to the mathematical foundations of modern cryptography. The book includes an extensive bibliography and index; supplementary materials are available online. The book covers a variety of topics that are considered central to mathematical cryptography. Key topics include: classical cryptographic constructions, such as Diffie–Hellmann key exchange, discrete logarithm-based cryptosystems, the RSA cryptosystem, and digital signatures; fundamental mathematical tools for cryptography, including primality testing, factorization algorithms, probability theory, information theory, and collision algorithms; an in-depth treatment of important cryptographic innovations, such as elliptic curves, elliptic curve and pairing-based cryptography, lattices, lattice-based cryptography, and the NTRU cryptosystem. The second edition of An Introduction to Mathematical Cryptography includes a significant revision of the material on digital signatures, including an earlier introduction to RSA, Elgamal, and DSA signatures, and new material on lattice-based signatures and rejection sampling. Many sections have been rewritten or expanded for clarity, especially in the chapters on information theory, elliptic curves, and lattices, and the chapter of additional topics has been expanded to include sections on digital cash and homomorphic encryption. Numerous new exercises have been included.

Employing a practical, "learn by doing" approach, this first-rate text fosters the development of the skills beyond the pure mathematics needed to set up and manipulate mathematical models. The author draws on a diversity of fields — including science, engineering, and operations research — to provide over 100 reality-based examples. Students learn from the examples by applying mathematical methods to formulate, analyze, and criticize models. Extensive documentation, consisting of over 150 references, supplements the models, encouraging further research on models of particular interest. The lively and accessible text requires only minimal scientific background. Designed for senior college or beginning graduate-level students, it assumes only elementary calculus and basic probability theory for the first part, and ordinary differential equations and continuous probability for the second section. All problems require students to study and create models, encouraging their active participation rather than a mechanical approach. Beyond the classroom, this volume will prove interesting and rewarding to anyone concerned with the development of mathematical models or the application of modeling to problem solving in a wide array of applications.

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography

William Aspray provides the first broad and detailed account of von Neumann's many different contributions to computing. John von Neumann (1903-1957) was unquestionably one of the most brilliant scientists of the twentieth century. He made major contributions to quantum mechanics and mathematical physics and in 1943 began a new and all-too-short career in computer science. William Aspray provides the first broad and detailed account of von Neumann's many different contributions to computing. These, Aspray reveals, extended far beyond his well-known work in the design and construction of computer systems to include important scientific applications, the revival of numerical analysis, and the creation of a theory of computing.Aspray points out that from the beginning von Neumann took a wider and more theoretical view than other computer pioneers. In the now famous EDVAC report of 1945, von Neumann clearly stated the idea of a stored program that resides in the computer's memory along with the data it was to operate on. This stored program computer was described in terms of idealized neurons, highlighting the analogy between the digital computer and the human brain. Aspray describes von Neumann's development during the next decade, and almost entirely alone, of a theory of complicated information processing systems, or automata, and the introduction of themes such as learning, reliability of systems with unreliable components, self-replication, and the importance of memory and storage capacity in biological nervous systems; many of these themes remain at the heart of current investigations in parallel or neurocomputing.Aspray allows the record to speak for itself. He unravels an intricate sequence of stories generated by von Neumann's work and brings into focus the interplay of personalities centered about von Neumann. He documents the complex interactions of science, the military, and business and shows how progress in applied mathematics was intertwined with that in computers. William Aspray is Director of the Center for the History of Electrical Engineering at The Institute of Electrical and Electronics Engineers.

Thirty years ago mathematical, as opposed to applied numerical, computation was difficult to perform and so relatively little used. Three threads changed that: the emergence of the personal computer; the discovery of fiber-optics and the consequent development of the modern internet; and the building of the Three “M’s” Maple, Mathematica and Matlab. We intend to persuade that Maple and other like tools are worth knowing assuming only that one wishes to be a mathematician, a mathematics educator, a computer scientist, an engineer or scientist, or anyone else who wishes/needs to use mathematics better. We also hope to explain how to become an `experimental mathematician' while learning to be better at proving things. To accomplish this our material is divided into three main chapters followed by a postscript. These cover elementary number theory, calculus of one and several variables, introductory linear algebra, and visualization and interactive geometric computation.

This illuminating textbook provides a concise review of the core concepts in mathematics essential to computer scientists. Emphasis is placed on the practical computing applications enabled by seemingly abstract mathematical ideas, presented within their historical context. The text spans a broad selection of key topics, ranging from the use of finite field theory to correct code and the role of number theory in cryptography, to the value of graph theory when modelling networks and the importance of formal methods for safety critical systems. This fully updated new edition has been expanded with a more comprehensive treatment of algorithms, logic, automata theory, model checking, software reliability and dependability, algebra, sequences and series, and mathematical induction. Topics and features: includes numerous pedagogical features, such as chapter-opening key topics, chapter introductions and summaries, review questions, and a glossary; describes the historical contributions of such prominent figures as Leibniz, Babbage, Boole, and von Neumann; introduces the fundamental mathematical concepts of sets, relations and functions, along with the basics of number theory, algebra, algorithms, and matrices; explores arithmetic and geometric sequences and series, mathematical induction and recursion, graph theory, computability and decidability, and automata theory; reviews the core issues of coding theory, language theory, software engineering, and software reliability, as well as formal methods and model checking; covers key topics on logic, from ancient Greek contributions to modern applications in AI, and discusses the nature of mathematical proof and theorem proving; presents a short introduction to probability and statistics, complex numbers and quaternions, and calculus. This engaging and easy-to-understand book will appeal to students of computer science wishing for an overview of the mathematics used in computing, and to mathematicians curious about how their subject is applied in the field of computer science. The book will also capture the interest of the motivated general reader.

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

Modern Mathematical Methods for Scientists and Engineers is a modern introduction to basic topics in mathematics at the undergraduate level, with emphasis on explanations and applications to real-life problems. There is also an 'Application' section at the end of each chapter, with topics drawn from a variety of areas, including neural networks, fluid dynamics, and the behavior of 'put' and 'call' options in financial markets. The book presents several modern important and computationally efficient topics, including feedforward neural networks, wavelets, generalized functions, stochastic optimization methods, and numerical methods.A unique and novel feature of the book is the introduction of a recently developed method for solving partial differential equations (PDEs), called the unified transform. PDEs are the mathematical cornerstone for describing an astonishingly wide range of phenomena, from quantum mechanics to ocean waves, to the diffusion of heat in matter and the behavior of financial markets. Despite the efforts of many famous mathematicians, physicists and engineers, the solution of partial differential equations remains a challenge.The unified transform greatly facilitates this task. For example, two and a half centuries after Jean d'Alembert formulated the wave equation and presented a solution for solving a simple problem for this equation, the unified transform derives in a simple manner a generalization of the d'Alembert solution, valid for general boundary value problems. Moreover, two centuries after Joseph Fourier introduced the classical tool of the Fourier series for solving the heat equation, the unified transform constructs a new solution to this ubiquitous PDE, with important analytical and numerical advantages in comparison to the classical solutions. The authors present the unified transform pedagogically, building all the necessary background, including functions of real and of complex variables and the Fourier transform, illustrating the method with numerous examples.Broad in scope, but pedagogical in style and content, the book is an introduction to powerful mathematical concepts and modern tools for students in science and engineering.