Description: This first book on greedy approximation gives a systematic presentation of the fundamental results. It also contains an introduction to two hot topics in numerical mathematics: learning theory and compressed sensing. Nonlinear approximation is becoming increasingly important, especially since two types are frequently employed in applications: adaptive methods are used in PDE solvers, while m-term approximation is used in image/signal/data processing, as well as in the design of neural networks. The fundamental question of nonlinear approximation is how to devise good constructive methods (algorithms) and recent results have established that greedy type algorithms may be the solution. The author has drawn on his own teaching experience to write a book ideally suited to graduate courses. The reader does not require a broad background to understand the material. Important open problems are included to give students and professionals alike ideas for further research.
Price: 93.73 AUD
Location: Hillsdale, NSW
End Time: 2024-11-10T12:23:07.000Z
Shipping Cost: 26.8 AUD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
Return policy details:
EAN: 9781107003378
UPC: 9781107003378
ISBN: 9781107003378
MPN: N/A
Book Title: Greedy Approximation by Vladimir Temlyakov
Item Length: 22.9 cm
Number of Pages: 432 Pages
Language: English
Publication Name: Greedy Approximation
Publisher: Cambridge University Press
Publication Year: 2011
Subject: Mathematics
Item Height: 235 mm
Item Weight: 760 g
Type: Textbook
Author: Vladimir Temlyakov
Item Width: 156 mm
Format: Hardcover
