Greedy algorithms for reduced bases in Banach spaces (Q2375939): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011121645 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.2290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Rates for Greedy Algorithms in Reduced Basis Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>A priori</i>convergence of the Greedy algorithm for the parametrized reduced basis method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5631335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global a priori convergence theory for reduced-basis approximations of single-parameter symmetric coercive elliptic partial differential equations / rank
 
Normal rank

Latest revision as of 13:30, 6 July 2024

scientific article
Language Label Description Also known as
English
Greedy algorithms for reduced bases in Banach spaces
scientific article

    Statements

    Greedy algorithms for reduced bases in Banach spaces (English)
    0 references
    0 references
    0 references
    25 June 2013
    0 references
    The authors study a new analysis of the performance of greedy algorithms. The analysis provides improved results for the Hilbert space and also similar methods give results for Banach spaces.
    0 references
    greedy algorithm
    0 references
    convergence rates
    0 references
    Banach spaces
    0 references
    Hilbert space
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references