Greedy Approximation
sen, 2011 · Cambridge Monographs on Applied and Computational Mathematics 20-kitob · Cambridge University Press
E-kitob
433
Sahifalar soni
reportReytinglar va sharhlar tasdiqlanmagan Batafsil
Bu e-kitob haqida
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.
Muallif haqida
Vladimir Temlyakov is Carolina Distinguished Professor in the Department of Mathematics at the University of South Carolina.
Bu e-kitobni baholang
Fikringizni bildiring.
Qayerda o‘qiladi
Smartfonlar va planshetlar
Android va iPad/iPhone uchun mo‘ljallangan Google Play Kitoblar ilovasini o‘rnating. U hisobingiz bilan avtomatik tazrda sinxronlanadi va hatto oflayn rejimda ham kitob o‘qish imkonini beradi.
Noutbuklar va kompyuterlar
Google Play orqali sotib olingan audiokitoblarni brauzer yordamida tinglash mumkin.
Kitob o‘qish uchun mo‘ljallangan qurilmalar
Kitoblarni Kobo e-riderlar kabi e-siyoh qurilmalarida oʻqish uchun faylni yuklab olish va qurilmaga koʻchirish kerak. Fayllarni e-riderlarga koʻchirish haqida batafsil axborotni Yordam markazidan olishingiz mumkin.
