An efficient radial basis functions mesh deformation with greedy algorithm based on recurrence Cholesky decomposition and parallel computing (Q2002464)

From MaRDI portal
Revision as of 08:30, 30 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient radial basis functions mesh deformation with greedy algorithm based on recurrence Cholesky decomposition and parallel computing
scientific article

    Statements

    An efficient radial basis functions mesh deformation with greedy algorithm based on recurrence Cholesky decomposition and parallel computing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 July 2019
    0 references
    mesh deformation
    0 references
    recurrence Cholesky decomposition method
    0 references
    radial basis functions
    0 references
    greedy algorithm
    0 references
    data reduction
    0 references
    parallel computing
    0 references

    Identifiers

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