Advertisement

Computer Aided Proofs in Analysis

  • Kenneth R. Meyer
  • Dieter S. Schmidt

Part of the The IMA Volumes in Mathematics and Its Applications book series (IMA, volume 28)

Table of contents

  1. Front Matter
    Pages i-xvi
  2. Johnnie W. Baker, Oberta A. Slotterbeck, Richard Aron
    Pages 12-21
  3. G. Bohlender, J. Wolff von Gudenberg, W. L. Miranker
    Pages 22-32
  4. Manuel Bronstein
    Pages 33-42
  5. Carmen Chicone, Marc Jacobs
    Pages 52-70
  6. Vincent T. Coppola, Richard H. Rand
    Pages 71-89
  7. George F. Corliss
    Pages 90-96
  8. Shannon Coffey, André Deprit, Étienne Deprit, Liam Healy, Bruce R. Miller
    Pages 97-115
  9. J.-P. Eckmann, A. Malaspinas, S. Oliffson Kamphorst
    Pages 147-167
  10. Anthony C. Hearn
    Pages 168-174
  11. Kenneth R. Meyer
    Pages 190-210
  12. L. B. Rall
    Pages 217-228
  13. Tim Sauer, James A. Yorke
    Pages 229-234
  14. Dieter S. Schmidt
    Pages 235-240

About this book

Introduction

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.

Keywords

Mathematica algebra algorithms bifurcation integration

Editors and affiliations

  • Kenneth R. Meyer
    • 1
  • Dieter S. Schmidt
    • 2
  1. 1.Departments of Mathematics and Computer ScienceUniversity of CincinnatiCincinnatiUSA
  2. 2.Department of Computer ScienceUniversity of CincinnatiCincinnatiUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4613-9092-3
  • Copyright Information Springer-Verlag New York 1991
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-9094-7
  • Online ISBN 978-1-4613-9092-3
  • Series Print ISSN 0940-6573
  • Buy this book on publisher's site