Faster Algorithms Via Approximation Theory

Faster Algorithms Via Approximation Theory
Author :
Publisher :
Total Pages : 108
Release :
ISBN-10 : 1601988206
ISBN-13 : 9781601988201
Rating : 4/5 (201 Downloads)

Book Synopsis Faster Algorithms Via Approximation Theory by : Sushant Sachdeva

Download or read book Faster Algorithms Via Approximation Theory written by Sushant Sachdeva and published by . This book was released on 2014-03-28 with total page 108 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Faster Algorithms Via Approximation Theory Related Books

Faster Algorithms Via Approximation Theory
Language: en
Pages: 108
Authors: Sushant Sachdeva
Categories: Computers
Type: BOOK - Published: 2014-03-28 - Publisher:

DOWNLOAD EBOOK

Faster Algorithms via Approximation Theory illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining results th
Approximation Theory and Approximation Practice, Extended Edition
Language: en
Pages: 377
Authors: Lloyd N. Trefethen
Categories: Mathematics
Type: BOOK - Published: 2019-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

This is a textbook on classical polynomial and rational approximation theory for the twenty-first century. Aimed at advanced undergraduates and graduate student
Algorithms for Convex Optimization
Language: en
Pages: 314
Authors: Nisheeth K. Vishnoi
Categories: Computers
Type: BOOK - Published: 2021-10-07 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For prob
Approximation Algorithms
Language: en
Pages: 380
Authors: Vijay V. Vazirani
Categories: Computers
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,
Geometric Approximation Algorithms
Language: en
Pages: 378
Authors: Sariel Har-Peled
Categories: Computers
Type: BOOK - Published: 2011 - Publisher: American Mathematical Soc.

DOWNLOAD EBOOK

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric appro