A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection (Q2804999)

From MaRDI portal
Revision as of 22:02, 11 July 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
A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection
scientific article

    Statements

    A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection (English)
    0 references
    0 references
    9 May 2016
    0 references
    Kansa method
    0 references
    kernel collocation
    0 references
    radial basis function
    0 references
    adaptive greedy algorithm
    0 references
    basis selection
    0 references
    0 references
    0 references
    0 references

    Identifiers

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