- We will send in 10–14 business days.
/images/books/11350215/9781601988201.jpg)
- Author: Sushant Sachdeva
- Publisher: Now Publishers
- Year: 2014
- Pages: 106
- ISBN-10: 1601988206
- ISBN-13: 9781601988201
- Format: 15.6 x 23.4 x 0.6 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.20:17:00
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Sushant Sachdeva
- Publisher: Now Publishers
- Year: 2014
- Pages: 106
- ISBN-10: 1601988206
- ISBN-13: 9781601988201
- Format: 15.6 x 23.4 x 0.6 cm, minkšti viršeliai
- Language: English English
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.
Reviews