Greedy Approximation
сеп 2011. · Cambridge Monographs on Applied and Computational Mathematics 20. књига · Cambridge University Press
E-knjiga
433
Stranica
reportOcene i recenzije nisu verifikovane Saznajte više
O ovoj e-knjizi
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.
O autoru
Vladimir Temlyakov is Carolina Distinguished Professor in the Department of Mathematics at the University of South Carolina.
Ocenite ovu e-knjigu
Javite nam svoje mišljenje.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play knjige za Android i iPad/iPhone. Automatski se sinhronizuje sa nalogom i omogućava vam da čitate onlajn i oflajn gde god da se nalazite.
Laptopovi i računari
Možete da slušate audio-knjige kupljene na Google Play-u pomoću veb-pregledača na računaru.
E-čitači i drugi uređaji
Da biste čitali na uređajima koje koriste e-mastilo, kao što su Kobo e-čitači, treba da preuzmete fajl i prenesete ga na uređaj. Pratite detaljna uputstva iz centra za pomoć da biste preneli fajlove u podržane e-čitače.
