Greedy Approximation
Part of Cambridge Monographs on Applied and Computational Mathematics
- Author: Vladimir Temlyakov, University of South Carolina
- Date Published: September 2011
- availability: Available
- format: Hardback
- isbn: 9781107003378
Hardback
Other available formats:
eBook
Looking for an inspection copy?
Please email [email protected] to enquire about an inspection copy of this book
-
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.
Read more- The first book on the hot topic of greedy approximation
- Developed from the author's first-class review published in Acta Numerica
- Covers classical results as well as the latest advances, and material has been tried and tested by the author in several graduate courses
- Open problems provide inspiration for further research
Reviews & endorsements
'The author is the leading expert on greedy approximation and this book offers a guided tour through the state of the art of the subject. Temlyakov's book is an excellent mathematical monograph and a valuable reference for researchers not only in approximation theory, but also in numerical mathematics, analysis, functional analysis, and statistics. The book is addressed mainly to researchers interested in greedy approximation and related areas. However, it is written at a level that is approachable for graduate students interested in the aforementioned areas, and it could be used for designing graduate courses in greedy approximation, learning theory and compressed sensing. As an added bonus, the author has included an extensive list of open problems in the area that can serve as inspiration for future research papers and dissertations.' Morten Nielsen, SIAM News
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: September 2011
- format: Hardback
- isbn: 9781107003378
- length: 432 pages
- dimensions: 235 x 156 x 25 mm
- weight: 0.76kg
- availability: Available
Table of Contents
Preface
1. Greedy approximation with respect to bases
2. Greedy approximation with respect to dictionaries: Hilbert spaces
3. The entropy
4. Approximation in learning theory
5. Approximation in compressed sensing
6. Greedy approximation with respect to dictionaries: Banach spaces
References
Index.
Related Books
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×