Two lower estimates in greedy approximation (Q1423641)

From MaRDI portal
Revision as of 08:19, 16 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Two lower estimates in greedy approximation
scientific article

    Statements

    Two lower estimates in greedy approximation (English)
    0 references
    0 references
    0 references
    7 March 2004
    0 references
    Given an arbitrary Hilbert space with a denumerable orthonormal basis, the authors construct two examples providing lower estimates for the rate of convergence of the pure Greedy algorithm and of the weak Greedy algorithm, respectively.
    0 references

    Identifiers