| Faster Algorithms Via Approximation Theory Contributor(s): Sachdeva, Sushant (Author), Vishnoi, Nisheeth K. (Author) |
|
 |
ISBN: 1601988206 ISBN-13: 9781601988201 Publisher: Now Publishers OUR PRICE: $71.25 Product Type: Paperback - Other Formats Published: March 2014 |
| Additional Information |
| BISAC Categories: - Computers | Computer Science |
| Series: Foundations and Trends(r) in Theoretical Computer Science |
| Physical Information: 0.22" H x 6.14" W x 9.21" (0.36 lbs) 108 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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. |