Explore the latest books of this year!
Bookbot

Greedy Approximation

Book rating

Parameters

  • 434 pages
  • 16 hours of reading

More about the book

The book offers a comprehensive exploration of the theoretical foundations essential for understanding algorithms in numerical mathematics. It covers both classical results and the latest advancements in the field, making it a valuable resource for those seeking to deepen their knowledge of numerical algorithms and their applications.

Book purchase

Greedy Approximation, Vladimir Temlyakov

Language
Released
2018
product-detail.submit-box.info.binding
(Hardcover)
We’ll email you as soon as we track it down.

Payment methods

4.7
Excellent
3 Ratings

We’re missing your review here.