Greedy Approximation

· Cambridge Monographs on Applied and Computational Mathematics Aklat 20 · Cambridge University Press
E-book
433
Mga Page
Hindi na-verify ang mga rating at review  Matuto Pa

Tungkol sa ebook na ito

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.

Tungkol sa may-akda

Vladimir Temlyakov is Carolina Distinguished Professor in the Department of Mathematics at the University of South Carolina.

I-rate ang e-book na ito

Ipalaam sa amin ang iyong opinyon.

Impormasyon sa pagbabasa

Mga smartphone at tablet
I-install ang Google Play Books app para sa Android at iPad/iPhone. Awtomatiko itong nagsi-sync sa account mo at nagbibigay-daan sa iyong magbasa online o offline nasaan ka man.
Mga laptop at computer
Maaari kang makinig sa mga audiobook na binili sa Google Play gamit ang web browser ng iyong computer.
Mga eReader at iba pang mga device
Para magbasa tungkol sa mga e-ink device gaya ng mga Kobo eReader, kakailanganin mong mag-download ng file at ilipat ito sa iyong device. Sundin ang mga detalyadong tagubilin sa Help Center para mailipat ang mga file sa mga sinusuportahang eReader.