Greedy Approximation : Cambridge Monographs on Applied and Computational Mathematics - Vladimir Temlyakov

Instant online reading.
Don't wait for delivery!
Go digital and save!

Greedy Approximation

By: Vladimir Temlyakov

Write A Review

Hardcover | 8 September 2011 | Edition Number 1

At a Glance

Hardcover
434 Pages

Dimensions(cm)
22.86 x 15.24 x 2.87

Hardcover

RRP $133.95

$121.75

or 4 interest-free payments of $30.44 with

or

Ships in 5 to 7 business days

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.

Industry Reviews

'The author is the leading expert on greedy approximation and this book offers a guided tour through the state of the art of the subject. Temlyakov's book is an excellent mathematical monograph and a valuable reference for researchers not only in approximation theory, but also in numerical mathematics, analysis, functional analysis, and statistics. The book is addressed mainly to researchers interested in greedy approximation and related areas. However, it is written at a level that is approachable for graduate students interested in the aforementioned areas, and it could be used for designing graduate courses in greedy approximation, learning theory and compressed sensing. As an added bonus, the author has included an extensive list of open problems in the area that can serve as inspiration for future research papers and dissertations.' Morten Nielsen, SIAM News

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

More in Numerical Analysis

Introductory Numerical Analysis - Griffin Cook

$82.99

51%
OFF

Introduction to Finite Element Analysis Using MATLAB® and Abaqus

Hardcover

RRP $200.00

$120.99

40%
OFF

Numerical Methods for Modeling Metasurface with GSTC

Hardcover

RRP $240.95

$176.99

27%
OFF

Mathematical Modeling and Simulation - Bernard Geurts

$211.75

12%
OFF

Impact Dynamics

A Numerical Approach

Hardcover

RRP $273.00

$236.99

13%
OFF

Fuzzy Model-Based Sliding Mode Control of Complex Nonlinear Systems : Engineering Mathematics and Operations Research - Wenqiang Ji

$189.75

Implicit-Explicit Methods for Evolutionary Partial Differential Equations

Paperback

RRP $206.00

$195.75

Practical Nonconvex Nonsmooth Optimization

Paperback

RRP $213.00

$201.99

Engineering Mathematics with MATLAB Applications : Vol. 1, Fundamentals - Hasan Kurtaran

$118.99

10%
OFF

Preface	p. ix
Greedy approximation with regard to bases	p. 1
Introduction	p. 1
Schauder bases in Banach spaces	p. 6
Greedy bases	p. 15
Quasi-greedy and almost greedy bases	p. 33
Weak Greedy Algorithms with respect to bases	p. 39
Thresholding and minimal systems	p. 43
Greedy approximation with respect to the trigonometric system	p. 47
Greedy-type bases; direct and inverse theorems	p. 58
Some further results	p. 63
Systems L_p-equivalent to the Haar basis	p. 68
Open problems	p. 76
Greedy approximation with respect to dictionaries: Hilbert spaces	p. 77
Introduction	p. 77
Convergence	p. 84
Rate of convergence	p. 89
Greedy algorithms for systems that are not dictionaries	p. 97
Greedy approximation with respect to -quasi-orthogonal dictionaries	p. 101
Lebesgue-type inequalities for greedy approximation	p. 111
Saturation property of greedy-type algorithms	p. 122
Some further remarks	p. 135
Open problems	p. 141
Entropy	p. 143
Introduction: definitions and some simple properties	p. 143
Finite dimensional spaces	p. 144
Trigonometric polynomials and volume estimates	p. 151
The function classes	p. 165
General inequalities	p. 168
Some further remarks	p. 175
Open problems	p. 182
Approximation in learning theory	p. 183
Introduction	p. 183
Some basic concepts of probability theory	p. 189
Improper function learning; upper estimates	p. 206
Proper function learning; upper estimates	p. 235
The lower estimates	p. 253
Application of greedy algorithms in learning theory	p. 270
Approximation in compressed sensing	p. 277
Introduction	p. 277
Equivalence of three approximation properties of the compressed sensing matrix	p. 283
Construction of a good matrix	p. 287
Dealing with noisy data	p. 294
First results on exact recovery of sparse signals; the Orthogonal Greedy Algorithm	p. 298
Exact recovery of sparse signals; the Subspace Pursuit Algorithm	p. 305
On the size of incoherent systems	p. 314
Restricted Isometry Property for random matrices	p. 327
Some further remarks	p. 330
Open problems	p. 332
Greedy approximation with respect to dictionaries: Banach spaces	p. 334
Introduction	p. 334
The Weak Chebyshev Greedy Algorithm	p. 340
Relaxation; co-convex approximation	p. 347
Free relaxation	p. 350
Fixed relaxation	p. 354
Thresholding algorithms	p. 359
Greedy expansions	p. 363
Relaxation; X-greedy algorithms	p. 378
Incoherent dictionaries and exact recovery	p. 381
Greedy algorithms with approximate evaluations and restricted search	p. 385
An application of greedy algorithms for the discrepancy estimates	p. 390
Open problems	p. 404
References	p. 405
Index	p. 415
Table of Contents provided by Ingram. All Rights Reserved.

Greedy Approximation

At a Glance

Hardcover

Industry Reviews

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Numerical Analysis

Introductory Numerical Analysis

Advances in Numerical Methods and Analysis

Learning Data Science

Data Wrangling, Exploration, Visualization, and Modeling with Python

Introduction to Finite Element Analysis Using MATLAB® and Abaqus

Numerical Methods for Modeling Metasurface with GSTC

Mathematical Modeling and Simulation

Stochastic Navier-Stokes Equations on Spheres and Spherical Shells

Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series

Impact Dynamics

A Numerical Approach

Fuzzy Model-Based Sliding Mode Control of Complex Nonlinear Systems

Engineering Mathematics and Operations Research

Numerical Partial Differential Equations

Implicit-Explicit Methods for Evolutionary Partial Differential Equations

Practical Nonconvex Nonsmooth Optimization

Engineering Mathematics with MATLAB Applications

Vol. 1, Fundamentals

Data-Driven Modeling & Scientific Computation

Methods for Complex Systems & Big Data

Numerical Analysis

A Comprehensive Study

Introduction to Numerical Analysis

FROM NUMBERS TO ANALYSIS

Constructions and Properties

All of Statistics

A Concise Course in Statistical Inference

Modern Numerical Nonlinear Optimization

Springer Optimization and Its Applications

Walter Gautschi

Selected Works With Commentaries

Novel Deep Learning Methodologies in Industrial and Applied Mathematics

Iciam2023 Springer

Physics-based and Data-driven Modeling for Digital Twins

Iciam2023 Springer

Integral Methods in Science and Engineering

Study and Solutions of Mathematical Models

Computing Concepts for Science, Engineering and Ai

Cseai 2023, Vizianagaram, India, November 29-30

This product is categorised by