This IMA Volume in Mathematics and its Applications COMPUTER AIDED PROOFS IN ANALYSIS is based on the proceedings of an IMA Participating Institutions (PI) Conference held at the University of Cincinnati in April 1989. Each year the 19 Participating Institutions select, through a competitive process, several conferences proposals from the PIs, for partial funding. This conference brought together leading figures in a number of fields who were interested in finding exact answers to problems in analysis through computer methods. We thank Kenneth Meyer and Dieter Schmidt for organizing the meeting and editing the proceedings. A vner Friedman Willard Miller, Jr. PREFACE Since the dawn of the computer revolution the vast majority of scientific compu tation has dealt with finding approximate solutions of equations. However, during this time there has been a small cadre seeking precise solutions of equations and rigorous proofs of mathematical results. For example, number theory and combina torics have a long history of computer-assisted proofs; such methods are now well established in these fields. In analysis the use of computers to obtain exact results has been fragmented into several schools.

In the last decades, various mathematical problems have been solved by computer-assisted proofs, among them the Kepler conjecture, the existence of chaos, the existence of the Lorenz attractor, the famous four-color problem, and more. In many cases, computer-assisted proofs have the remarkable advantage (compared with a “theoretical” proof) of additionally providing accurate quantitative information. The authors have been working more than a quarter century to establish methods for the verified computation of solutions for partial differential equations, mainly for nonlinear elliptic problems of the form -∆u=f(x,u,∇u) with Dirichlet boundary conditions. Here, by “verified computation” is meant a computer-assisted numerical approach for proving the existence of a solution in a close and explicit neighborhood of an approximate solution. The quantitative information provided by these techniques is also significant from the viewpoint of a posteriori error estimates for approximate solutions of the concerned partial differential equations in a mathematically rigorous sense. In this monograph, the authors give a detailed description of the verified computations and computer-assisted proofs for partial differential equations that they developed. In Part I, the methods mainly studied by the authors Nakao and Watanabe are presented. These methods are based on a finite dimensional projection and constructive a priori error estimates for finite element approximations of the Poisson equation. In Part II, the computer-assisted approaches via eigenvalue bounds developed by the author Plum are explained in detail. The main task of this method consists of establishing eigenvalue bounds for the linearization of the corresponding nonlinear problem at the computed approximate solution. Some brief remarks on other approaches are also given in Part III. Each method in Parts I and II is accompanied by appropriate numerical examples that confirm the actual usefulness of the authors’ methods. Also in some examples practical computer algorithms are supplied so that readers can easily implement the verification programs by themselves.

This IMA Volume in Mathematics and its Applications COMPUTER AIDED PROOFS IN ANALYSIS is based on the proceedings of an IMA Participating Institutions (PI) Conference held at the University of Cincinnati in April 1989. Each year the 19 Participating Institutions select, through a competitive process, several conferences proposals from the PIs, for partial funding. This conference brought together leading figures in a number of fields who were interested in finding exact answers to problems in analysis through computer methods. We thank Kenneth Meyer and Dieter Schmidt for organizing the meeting and editing the proceedings. A vner Friedman Willard Miller, Jr. PREFACE Since the dawn of the computer revolution the vast majority of scientific compu tation has dealt with finding approximate solutions of equations. However, during this time there has been a small cadre seeking precise solutions of equations and rigorous proofs of mathematical results. For example, number theory and combina torics have a long history of computer-assisted proofs; such methods are now well established in these fields. In analysis the use of computers to obtain exact results has been fragmented into several schools.

A textbook that teaches students to read and write proofs using Athena. Proof is the primary vehicle for knowledge generation in mathematics. In computer science, proof has found an additional use: verifying that a particular system (or component, or algorithm) has certain desirable properties. This book teaches students how to read and write proofs using Athena, a freely downloadable computer language. Athena proofs are machine-checkable and written in an intuitive natural-deduction style. The book contains more than 300 exercises, most with full solutions. By putting proofs into practice, it demonstrates the fundamental role of logic and proof in computer science as no other existing text does. Guided by examples and exercises, students are quickly immersed in the most useful high-level proof methods, including equational reasoning, several forms of induction, case analysis, proof by contradiction, and abstraction/specialization. The book includes auxiliary material on SAT and SMT solving, automated theorem proving, and logic programming. The book can be used by upper undergraduate or graduate computer science students with a basic level of programming and mathematical experience. Professional programmers, practitioners of formal methods, and researchers in logic-related branches of computer science will find it a valuable reference.

Mathematics of Computing -- Numerical Analysis.

Computer-Aided Reasoning: ACL2 Case Studies illustrates how the computer-aided reasoning system ACL2 can be used in productive and innovative ways to design, build, and maintain hardware and software systems. Included here are technical papers written by twenty-one contributors that report on self-contained case studies, some of which are sanitized industrial projects. The papers deal with a wide variety of ideas, including floating-point arithmetic, microprocessor simulation, model checking, symbolic trajectory evaluation, compilation, proof checking, real analysis, and several others. Computer-Aided Reasoning: ACL2 Case Studies is meant for two audiences: those looking for innovative ways to design, build, and maintain hardware and software systems faster and more reliably, and those wishing to learn how to do this. The former audience includes project managers and students in survey-oriented courses. The latter audience includes students and professionals pursuing rigorous approaches to hardware and software engineering or formal methods. Computer-Aided Reasoning: ACL2 Case Studies can be used in graduate and upper-division undergraduate courses on Software Engineering, Formal Methods, Hardware Design, Theory of Computation, Artificial Intelligence, and Automated Reasoning. The book is divided into two parts. Part I begins with a discussion of the effort involved in using ACL2. It also contains a brief introduction to the ACL2 logic and its mechanization, which is intended to give the reader sufficient background to read the case studies. A more thorough, textbook introduction to ACL2 may be found in the companion book, Computer-Aided Reasoning: An Approach. The heart of the book is Part II, where the case studies are presented. The case studies contain exercises whose solutions are on the Web. In addition, the complete ACL2 scripts necessary to formalize the models and prove all the properties discussed are on the Web. For example, when we say that one of the case studies formalizes a floating-point multiplier and proves it correct, we mean that not only can you read an English description of the model and how it was proved correct, but you can obtain the entire formal content of the project and replay the proofs, if you wish, with your copy of ACL2. ACL2 may be obtained from its home page. The results reported in each case study, as ACL2 input scripts, as well as exercise solutions for both books, are available from this page.

Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software is by computer-assisted verification of its correctness proofs. This book provides a comprehensive view of how to formally specify and verify tricky floating-point algorithms with the Coq proof assistant. It describes the Flocq formalization of floating-point arithmetic and some methods to automate theorem proofs. It then presents the specification and verification of various algorithms, from error-free transformations to a numerical scheme for a partial differential equation. The examples cover not only mathematical algorithms but also C programs as well as issues related to compilation. - Describes the notions of specification and weakest precondition computation and their practical use - Shows how to tackle algorithms that extend beyond the realm of simple floating-point arithmetic - Includes real analysis and a case study about numerical analysis

This book investigates some of the difficulties related to scientific computing, describing how these can be overcome.

The must-have compendium on applied mathematics This is the most authoritative and accessible single-volume reference book on applied mathematics. Featuring numerous entries by leading experts and organized thematically, it introduces readers to applied mathematics and its uses; explains key concepts; describes important equations, laws, and functions; looks at exciting areas of research; covers modeling and simulation; explores areas of application; and more. Modeled on the popular Princeton Companion to Mathematics, this volume is an indispensable resource for undergraduate and graduate students, researchers, and practitioners in other disciplines seeking a user-friendly reference book on applied mathematics. Features nearly 200 entries organized thematically and written by an international team of distinguished contributors Presents the major ideas and branches of applied mathematics in a clear and accessible way Explains important mathematical concepts, methods, equations, and applications Introduces the language of applied mathematics and the goals of applied mathematical research Gives a wide range of examples of mathematical modeling Covers continuum mechanics, dynamical systems, numerical analysis, discrete and combinatorial mathematics, mathematical physics, and much more Explores the connections between applied mathematics and other disciplines Includes suggestions for further reading, cross-references, and a comprehensive index