Fast simplicial quadrature-based finite element operators using Bernstein polynomials (Q431308): Difference between revisions

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:14, 5 March 2024

scientific article
Language Label Description Also known as
English
Fast simplicial quadrature-based finite element operators using Bernstein polynomials
scientific article

    Statements

    Fast simplicial quadrature-based finite element operators using Bernstein polynomials (English)
    0 references
    0 references
    0 references
    26 June 2012
    0 references
    The authors derive a low-complexity matrix-free finite element algorithm for simplicial Bernstein polynomials on simplices. The technique is based on a sparse representation of differentiation and the special block structure in the matrices evaluating B-form polynomials at warped Gauss points.
    0 references
    finite elements
    0 references
    Bernstein polynomials
    0 references
    complexity
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers