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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00211-011-0431-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994388915 / rank
 
Normal rank

Revision as of 21:58, 19 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