75 years of Mathematics of computation : symposium, Celebrating 75 Years of Mathematics of Computation, November 1-3, 2018, the Institute for Computational and Experimental Research in Mathematics (ICERM)
Author(s)
Bibliographic Information
75 years of Mathematics of computation : symposium, Celebrating 75 Years of Mathematics of Computation, November 1-3, 2018, the Institute for Computational and Experimental Research in Mathematics (ICERM)
（Contemporary mathematics, 754）
American Mathematical Society, c2020
- : pbk
Available at 20 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: pbkS||CONM||754200040918362
Note
Other editors: Igor Shparlinski, Chi-Wang Shu, Daniel B. Szyld
Includes bibliographical references
Description and Table of Contents
Description
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.
Table of Contents
Preface
Invited presentations at the symposium
Adaptive low-rank approximations for operator equations: Accuracy control and computational complexity, Markus Bachmayr and Wolfgang Dahmen
The Prager–Synge theorem in reconstruction based a posteriori error estimation, Fleurianne Bertrand and Daniele Boffi
Linear and nonlinear fractional elliptic problems, Juan Pablo Borthagaray, Wenbo Li, and Ricardo H. Nochetto
Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters, Ronald Cools, Frances Y. Kuo, Dirk Nuyens, and Ian H. Sloan
Multiscale modeling, homogenization and nonlocal effects: Mathematical andcomputational issues, Qiang Du, Bjorn Engquist, and Xiaochuan Tian
The Stokes complex: A review of exactly divergence–free finite element pairs for incompressible flows, Michael Neilan
Finite element methods for Maxwell’s equations, Peter Monk and Yangwen Zhang
Partial differential equation regularization for supervised machine learning, Adam M. Oberman
Iterative methods for linear systems of equations: A brief historical journey, Yousef Saad
The IEQ and SAV approaches and their extensions for a class of highlynonlinear gradient flow systems, Jie Shen and Xiaofeng Yang
A class of bound-preserving high order schemes: The main ideas and recent developments, Chi-Wang Shu
BDDC domain decomposition algorithms, Olof B. Widlund
Computing modular polynomials and isogenies of rank two Drinfeldmodules over finite fields, Perlas Caranay, Matthew Greenberg, and Renate Scheidler
A new ranking function for polynomial selection in the number field sieve, Nicolas David and Paul Zimmermann
A nilpotent quotient algorithm for finitely presented associative Z-algebras and its application to integral group rings, Bettina Eick and Tobias Moede
A tale of two omegas, Michael J. Mossinghoff and Timothy S. Trudgian
by "Nielsen BookData"