Average-Case Analysis of Numerical Problems

  • Editors
  • KlausĀ Ritter

Part of the Lecture Notes in Mathematics book series (LNM, volume 1733)

Table of contents

  1. Front Matter
    Pages i-ix
  2. Klaus Ritter
    Pages 1-9
  3. Klaus Ritter
    Pages 33-65
  4. Klaus Ritter
    Pages 183-211
  5. Klaus Ritter
    Pages 213-225
  6. Back Matter
    Pages 227-254

About this book


The average-case analysis of numerical problems is the counterpart of the more traditional worst-case approach. The analysis of average error and cost leads to new insight on numerical problems as well as to new algorithms. The book provides a survey of results that were mainly obtained during the last 10 years and also contains new results. The problems under consideration include approximation/optimal recovery and numerical integration of univariate and multivariate functions as well as zero-finding and global optimization. Background material, e.g. on reproducing kernel Hilbert spaces and random fields, is provided.


Bayesian numerical analysis Gaussian measure Numerical integration information-based complexity optimal numerical methods spatial statistics

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0103934
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-67449-8
  • Online ISBN 978-3-540-45592-9
  • Series Print ISSN 0075-8434
  • Series Online ISSN 1617-9692
  • About this book