Simultaneous approximation by greedy algorithms (Q2498388)

From MaRDI portal
Revision as of 19:10, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Simultaneous approximation by greedy algorithms
scientific article

    Statements

    title
    Simultaneous approximation by greedy algorithms (English)
    0 references
    publication date
    16 August 2006
    0 references
    Mathematics Subject Classification ID
    41A65
    0 references
    41A25
    0 references
    41A46
    0 references
    46B20
    0 references
    41A28
    0 references
    zbMATH DE Number
    5046818
    0 references
    zbMATH Keywords
    greedy algorithms
    0 references
    convergence
    0 references
    simultaneous approximation
    0 references
    author
    Dany Leviatan
    0 references
    Vladimir N. Temlyakov
    0 references
    OpenAlex ID
    W1964901013
    0 references
    cites work
    Q4215356
    0 references
    Q5290964
    0 references
    Projection pursuit
    0 references
    Q2752669
    0 references
    Q2752680
    0 references
    Q4439542
    0 references
    Q2783079
    0 references
    Q4233472
    0 references
    Weak greedy algorithms
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2498388&oldid=34885845"
    Powered by MediaWiki