Faster Algorithms Via Approximation Theory

by ,

Write The First Customer Review

Approximation Theory and Fast Algorithms 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. For example, it shows how to compute good approximations to matrix-vector products such as Asv; A-1v and exp(-A)v for any matrix A and a vector v.6. It also shows how to speed up algorithms that compute the top few eigenvalues and eigenvectors of a symmetric matrix A. Such primitives are useful for ...

Faster Algorithms via Approximation Theory 2014, now publishers Inc, Hanover

ISBN-13: 9781601988201

Paperback

Select