Skip to content
Register Sign in Wishlist
Operator-Adapted Wavelets, Fast Solvers, and Numerical Homogenization

Operator-Adapted Wavelets, Fast Solvers, and Numerical Homogenization
From a Game Theoretic Approach to Numerical Approximation and Algorithm Design


Part of Cambridge Monographs on Applied and Computational Mathematics

  • Publication planned for: October 2019
  • availability: Not yet published - available from October 2019
  • format: Hardback
  • isbn: 9781108484367

£ 120.00

Pre-order Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • Although numerical approximation and statistical inference are traditionally covered as entirely separate subjects, they are intimately connected through the common purpose of making estimations with partial information. This book explores these connections from a game and decision theoretic perspective, showing how they constitute a pathway to developing simple and general methods for solving fundamental problems in both areas. It illustrates these interplays by addressing problems related to numerical homogenization, operator adapted wavelets, fast solvers, and Gaussian processes. This perspective reveals much of their essential anatomy and greatly facilitates advances in these areas, thereby appearing to establish a general principle for guiding the process of scientific discovery. This book is designed for graduate students, researchers, and engineers in mathematics, applied mathematics, and computer science, and particularly researchers interested in drawing on and developing this interface between approximation, inference, and learning.

    • Features over seventy-five color figures that illustrate key concepts and formulas
    • Offers a self-contained treatment of the subject, covering a large array of topics, which can serve as a training ground for young researchers
    • Includes worked examples that teach readers to guide their own investigations
    Read more

    Reviews & endorsements

    'This is a terrific book. A hot new topic, first rate mathematics, real applications. It's an important contribution by marvelous scholars.' Persi Diaconis, Stanford University

    'This book does a masterful job of bringing together the two seemingly unrelated fields of numerical approximation and statistical inference to produce a general framework for developing solvers that are both provably accurate and scale to extremely large problem sizes. It seamlessly integrates concepts from numerical approximation, statistical inference, information-based complexity, and game theory to reveal a rich mathematical structure that forms a comprehensive foundation for solver development. Of tremendous value to the practitioner is a thorough analysis of solver accuracy and computational requirements. In addition to providing a comprehensive guide to solver development and analysis this book presents a unique perspective that provides numerous valuable insights into the solution of science and engineering problems.' Don Hush, University of New Mexico

    'This unique book provides a novel game-theoretic approach to Probabilistic Scientific Computing by exploring the interplay between numerical approximation and statistical inference, and exploits such links to develop new fast methods for solving partial differential equations. Gamblets are magic basis functions resulting from a clever adversarial zero sum game between two players and can be used in modeling multiscale problems with no scale separation in numerical homogenization. The book provides original exposition to many topics of the modern era of scientific computing, including sparse representation of Gaussian fields, probabilistic interpretation of numerical errors, linear complexity algorithms, and rigorous settings in the Sobolev and Banach spaces of these topics. It is appropriate for graduate-level courses and as a valuable reference for any scientist who is interested in rigorous understanding and use of modern numerical algorithms in problems where data and mathematical models co-exist.' George Karniadakis, Brown University

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Publication planned for: October 2019
    • format: Hardback
    • isbn: 9781108484367
    • dimensions: 228 x 152 mm
    • contains: 83 colour illus.
    • availability: Not yet published - available from October 2019
  • Table of Contents

    1. Introduction
    2. Sobolev space basics
    3. Optimal recovery splines
    4. Numerical homogenization
    5. Operator adapted wavelets
    6. Fast solvers
    7. Gaussian fields
    8. Optimal recovery games on $\mathcal{H}^{s}_{0}(\Omega)$
    9. Gamblets
    10. Hierarchical games
    11. Banach space basics
    12. Optimal recovery splines
    13. Gamblets
    14. Bounded condition numbers
    15. Exponential decay
    16. Fast Gamblet Transform
    17. Gaussian measures, cylinder measures, and fields on $\mathcal{B}$
    18. Recovery games on $\mathcal{B}$
    19. Game theoretic interpretation of Gamblets
    20. Survey of statistical numerical approximation
    21. Positive definite matrices
    22. Non-symmetric operators
    23. Time dependent operators
    24. Dense kernel matrices
    25. Fundamental concepts.

  • Authors

    Houman Owhadi, California Institute of Technology
    Houman Owhadi is Professor of Applied and Computational Mathematics and Control and Dynamical Systems in the Computing and Mathematical Sciences department at the California Institute of Technology. He is one of the main editors of the Handbook of Uncertainty Quantification (2016). His research interests concern the exploration of interplays between numerical approximation, statistical inference and learning from a game theoretic perspective, especially the facilitation/automation possibilities emerging from these interplays.

    Clint Scovel, California Institute of Technology
    Clint Scovel is a Research Associate in the Computing and Mathematical Sciences department at the California Institute of Technology, after a twenty-six-year career at Los Alamos National Laboratory, including foundational research in symplectic algorithms and machine learning. He received his Ph.D. in mathematics from the Courant Institute of Mathematics at New York University in 1983. He currently works on uncertainty quantification, Bayesian methods, incorporating computational complexity in Wald's statistical decision theory, operator adapted wavelets and fast solvers.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.