Faster Algorithms via Approximation Theory (Paperback)

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.

General

Imprint:	Now Publishers Inc
Country of origin:	United States
Series:	Foundations and Trends (R) in Theoretical Computer Science
Release date:	April 2014
First published:	2014
Authors:	Sushant Sachdeva • Nisheeth K. Vishnoi
Dimensions:	234 x 156 x 6mm (L x W x T)
Format:	Paperback
Pages:	108
ISBN-13:	978-1-60198-820-1
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General
LSN:	1-60198-820-6
Barcode:	9781601988201

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!