Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Lebesgue-type"”.

  1. Additive Lebesgue-Type Inequalities for Greedy Approximation

    <p>In the approximation theory we are commonly interested in finding a best possible approximant to a function (also thought of as a signal or an image in signal processing) from a collection of a given number of elements. In the recent years, there arose an interest in considering rich collections …

    south-carolina Repository record for Additive Lebesgue-Type Inequalities for Greedy Approximation (opens in a new tab)

  2. Greedy Algorithms In Approximation Theory and Compressed Sensing

    … answers the question for some greedy type methods. We approach the problem from two aspects, Nonlinear Approximation Theory and Compressed Sensing. In the setting of Nonlinear Approximation Theory, we mainly study the direction (Jackson) and inverse (Bernstein) theorems with bases that …

    south-carolina Repository record for Greedy Algorithms In Approximation Theory and Compressed Sensing (opens in a new tab)

  3. Sparse Approximation In Banach Spaces

    <p>The sparse approximation problems ask for complete recovery of functions in a given space that are supported by few of the elements of a system of generators for the space or for approximate recovery that involves a limited number of generators.</p> <p>Traditionally, these problems have been …

    south-carolina Repository record for Sparse Approximation In Banach Spaces (opens in a new tab)