Andere Kunden interessierten sich auch für
![The Design of Competitive Online Algorithms via a Primal-Dual Approach]( "The Design of Competitive Online Algorithms via a Primal-Dual Approach")
The Design of Competitive Online Algorithms via a Primal-Dual Approach108,99 €![Energy Efficiency in Wireless Networks via Fractional Programming Theory]( "Energy Efficiency in Wireless Networks via Fractional Programming Theory")
Energy Efficiency in Wireless Networks via Fractional Programming Theory108,99 €![Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers]( "Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers")
Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers93,99 €![Zero Bugs and Program Faster]( "Zero Bugs and Program Faster")
Zero Bugs and Program Faster28,99 €![Soft Computing Guided Faster Exponentiation Techniques]( "Soft Computing Guided Faster Exponentiation Techniques")
Soft Computing Guided Faster Exponentiation Techniques44,99 €![Full and partial Jacobian computation via graph coloring: Algorithms and applications]( "Full and partial Jacobian computation via graph coloring: Algorithms and applications")
Full and partial Jacobian computation via graph coloring: Algorithms and applications36,77 €![Nonlinear Dynamics in Complex Systems via Fractals and Fractional Calculus]( "Nonlinear Dynamics in Complex Systems via Fractals and Fractional Calculus")
Nonlinear Dynamics in Complex Systems via Fractals and Fractional Calculus96,99 €
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.