Greedy Approximation
sep 2011. · Cambridge Monographs on Applied and Computational Mathematics 20. knjiga · Cambridge University Press
E-knjiga
433
Broj stranica
reportOcjene i recenzije nisu potvrđene 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.
Ocijenite ovu e-knjigu
Recite nam šta mislite.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play Knjige za Android i iPad/iPhone uređaje. Aplikacija se automatski sinhronizira s vašim računom i omogućava vam čitanje na mreži ili van nje gdje god da se nalazite.
Laptopi i računari
Audio knjige koje su kupljene na Google Playu možete slušati pomoću web preglednika na vašem računaru.
Elektronički čitači i ostali uređaji
Da čitate na e-ink uređajima kao što su Kobo e-čitači, morat ćete preuzeti fajl i prenijeti ga na uređaj. Pratite detaljne upute Centra za pomoć da prenesete fajlove na podržane e-čitače.
