The year 2018 marked the 75th anniversary of the founding of Mathematics of Computation, one of the four primary research journals published by the American Mathematical Society and the oldest research journal devoted to computational mathematics. To celebrate this milestone, the symposium ""Celebrating 75 Years of Mathematics of Computation"" was held from November 1-3, 2018, at the Institute for Computational and Experimental Research in Mathematics (ICERM), Providence, Rhode Island. The sixteen papers in this volume, written by the symposium speakers and editors of the journal, include both.

The year 2018 marked the 75th anniversary of the founding of Mathematics of Computation, one of the four primary research journals published by the American Mathematical Society and the oldest research journal devoted to computational mathematics. To celebrate this milestone, the symposium “Celebrating 75 Years of Mathematics of Computation” was held from November 1–3, 2018, at the Institute for Computational and Experimental Research in Mathematics (ICERM), Providence, Rhode Island. The sixteen papers in this volume, written by the symposium speakers and editors of the journal, include both survey articles and new contributions. On the discrete side, there are four papers covering topics in computational number theory and computational algebra. On the continuous side, there are twelve papers covering topics in machine learning, high dimensional approximations, nonlocal and fractional elliptic problems, gradient flows, hyperbolic conservation laws, Maxwell's equations, Stokes's equations, a posteriori error estimation, and iterative methods. Together they provide a snapshot of significant achievements in the past quarter century in computational mathematics and also in important current trends.

Proceedings of an International Conference held in Vancouver, B.C., August 1993, to commemorate the 50th anniversary of the founding of the journal Mathematics of Computation. It consisted of a Symposium on Numerical Analysis and a Minisymposium of Computational Number Theory. This proceedings contains 14 invited papers, including two not presented at the conference--an historical essay on integer factorization, and a paper on componentwise perturbation bounds in linear algebra. The invited papers present surveys on the various subdisciplines covered by Mathematics of Computation, in a historical perspective and in a language accessible to a wide audience. The 46 contributed papers address contemporary specialized work. Annotation copyright by Book News, Inc., Portland, OR

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

A panorama of new ideas in mathematics that are driving innovation in computing and communications.

Original articles on all aspects of numerical mathematics, book reviews, mathematical tables, and technical notes. Covers advances in numerical analysis, application of computer methods, high speed calculating, and other aids to computation.