Picture 1 of 3
Stock photo
Picture 1 of 3
Stock photo
Foundations and Trends in Theoretical Computer Science Ser.: Faster Algorithms Via Approximation Theory by Sushant Sachdeva and Nisheeth K. Vishnoi (2014, Trade Paperback)
rarewaves-usa (467439)
98.3% positive feedback
Price:
US $109.44
(inclusive of GST)
ApproximatelyS$ 140.03
+ $4.35 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherNow Publishers
ISBN-101601988206
ISBN-139781601988201
eBay Product ID (ePID)240064214
Product Key Features
Number of Pages108 Pages
Publication NameFaster Algorithms Via Approximation Theory
LanguageEnglish
Publication Year2014
SubjectComputer Science
TypeTextbook
AuthorSushant Sachdeva, Nisheeth K. Vishnoi
Subject AreaComputers
SeriesFoundations and Trends in Theoretical Computer Science Ser.
FormatTrade Paperback
Dimensions
Item Height0.2 in
Item Weight5.8 Oz
Item Length9.2 in
Item Width6.1 in
Additional Product Features
Intended AudienceScholarly & Professional
Table Of ContentIntroduction. I APPROXIMATION THEORY: 1. Uniform Approximations 2. Chebyshev Polynomials 3. Approximating Monomials 4. Approximating the Exponential 5. Lower Bounds for Polynomial Approximations 6. Approximating the Exponential using Rational Functions 7. Rational Approximations to the Exponential with Negative Poles II APPLICATIONS: 8. Simulating Random Walks 9. Solving Linear Equations via the Conjugate Gradient Method 10. Computing Eigenvalues via the Lanczos Method 11. Computing the Matrix Exponential 12. Matrix Inversion via Exponentiation. References.
SynopsisFaster 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 illustrates how classical and modern results from approximation theory play a crucial role in obtaining results that are relevant to the emerging theory of fast algorithms today.
All listings for this product
Be the first to write a review
