Greedy approximation / Vladimir Temlyakov.

• Superior document: Cambridge monographs on applied and computational mathematics ; 20
• Author: ProQuest (Firm); Temlyakov, Vladimir, 1953-
• TeilnehmendeR: ProQuest (Firm)
• Year of Publication: 2011
• Language: English
• Series: Cambridge monographs on applied and computational mathematics ; 20.
• Physical Description: xiv, 418 p.
• Bibliography: Includes bibliographical references and index.
• ISBN: 9781107003378 (hardback); 9781139157551 (electronic bk.)
• Hierarchical level: Monograph
• Statement of Responsibility: Vladimir Temlyakov.

"An introduction to two hot topics in numerical mathematics: learning theory and compressed sensing. This book possesses features of both a survey paper and a textbook. The majority of results are given with proofs. However,some important results with technically involved proofs are presented without proof. We included proofs of the most important and typical results; and we tried to include those proofs which demonstrate different ideas and are based on different techniques. In this sense the book has a feature of a survey - it tries to cover broad material. On the other hand, we limit ourselves to a systematic treatment of a specific topic rather than trying to give an overview of all related topics. In this sense the book is close to a textbook. There are many papers on theoretical and computational aspects of greedy approximation, learning theory and compressed sensing. We have chosen to cover the mathematical foundations of greedy approximation, learning theory and compressed sensing. The book is addressed to researchers working in numerical mathematics, analysis, functional analysis and statistics. It quickly takes the reader from classical results to the frontier of the unknown, but is written at the level of a graduate course and does not require a broad background in order to understand the topics"--