Greedy Approximation

Informationen zum Autor Vladimir Temlyakov is Carolina Distinguished Professor in the Department of Mathematics at the University of South Carolina. Klappentext Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results! as well as the latest advances. Zusammenfassung Vladimir Temlyakov guides the reader through the fundamental results and introduces two other hot topics in numerical mathematics: learning theory and compressed sensing. Researchers will welcome this first book on the subject. It is ideal for graduate courses and includes many important open problems that provide ideas for further research. Inhaltsverzeichnis 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.

Product details

• Authors: Vladimir Temlyakov, Vladimir (University of South Carolina) Temlyakov, TEMLYAKOV VLADIMIR
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 08.09.2011
• EAN: 9781107003378
• ISBN: 978-1-107-00337-8
• No. of pages: 432
• Series: Cambridge Monographs on Applied and Computational Mathematics; Cambridge Monographs on Applie; Cambridge Monographs on Applied and Computational; Cambridge Monographs on Applied and Computational Mathematics; Cambridge Monographs on Applied and Computational
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > Programming languages