Approximation Theory and the Design of Fast Algorithms
Data Structures and Algorithms
2013-09-20 v1 Classical Analysis and ODEs
Numerical Analysis
Abstract
We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used to speed up primitives crucial for the design of fast algorithms for problems such as simulating random walks, graph partitioning, solving linear system of equations, computing eigenvalues and combinatorial approaches to solve semi-definite programs.
Cite
@article{arxiv.1309.4882,
title = {Approximation Theory and the Design of Fast Algorithms},
author = {Sushant Sachdeva and Nisheeth Vishnoi},
journal= {arXiv preprint arXiv:1309.4882},
year = {2013}
}