Trending Bestseller

Faster Algorithms Via Approximation Theory

No reviews yet Write a Review
Paperback / softback
28 March 2014
$182.47
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
Faster Algorithms via Approximation Theory illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining results that are relevant to the emerging theory of fast algorithms. The key lies in the fact that such results imply faster ways to approximate primitives such as products of matrix functions with vectors and, to compute matrix eigenvalues and eigenvectors, which are fundamental to many spectral algorithms.The first half of the book is devoted to the ideas and results from approximation theory that are central, elegant, and may have wider applicability in theoretical computer science. These include not only techniques relating to polynomial approximations but also those relating to approximations by rational functions and beyond. The remaining half illustrates a variety of ways that these results can be used to design fast algorithms.Faster Algorithms via Approximation Theory is self-contained and should be of interest to researchers and students in theoretical computer science, numerical linear algebra, and related areas.

You Can Find This Title In

    Product Details
    ISBN-13
    9781601988201
    Author
    Sushant Sachdeva
    Publisher
    Now Publishers
    Published
    28 March 2014
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $182.47
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Faster Algorithms Via Approximation Theory

    $182.47

    Description

    Faster Algorithms via Approximation Theory illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining results that are relevant to the emerging theory of fast algorithms. The key lies in the fact that such results imply faster ways to approximate primitives such as products of matrix functions with vectors and, to compute matrix eigenvalues and eigenvectors, which are fundamental to many spectral algorithms.The first half of the book is devoted to the ideas and results from approximation theory that are central, elegant, and may have wider applicability in theoretical computer science. These include not only techniques relating to polynomial approximations but also those relating to approximations by rational functions and beyond. The remaining half illustrates a variety of ways that these results can be used to design fast algorithms.Faster Algorithms via Approximation Theory is self-contained and should be of interest to researchers and students in theoretical computer science, numerical linear algebra, and related areas.

    You Can Find This Title In

      This Title Is Categorised As