Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results, as well as the latest advances.
"synopsis" may belong to another edition of this title.
Vladimir Temlyakov is Carolina Distinguished Professor in the Department of Mathematics at the University of South Carolina.
"About this title" may belong to another edition of this title.
Seller: Bill & Ben Books, Faringdon, United Kingdom
Hardback. Condition: New. 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. Seller Inventory # 0104517
Quantity: 1 available
Seller: AMM Books, Gillingham, KENT, United Kingdom
Hardcover. Condition: Very Good. Unread. In stock ready to dispatch from the UK. Seller Inventory # mon0000205079
Quantity: 9 available
Seller: AMM Books, Gillingham, KENT, United Kingdom
Hardcover. Condition: New. In stock ready to dispatch from the UK. Seller Inventory # mon0000205080
Quantity: 13 available
Seller: StainesBook, Weybridge, SURRE, United Kingdom
Seller Inventory # SpeedList-SLUSA254
Quantity: 1 available
Seller: Book Grocer, Tullamarine, VIC, Australia
Hardback. Vladimir Temlyakov (University of South Carolina), Cambridge University Press. 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. Hardback. Seller Inventory # 9781107003378
Quantity: 1 available
Seller: Labyrinth Books, Princeton, NJ, U.S.A.
Condition: Very Good. Seller Inventory # 146939
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 12464598
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781107003378_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 12464598-n
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 12464598-n