Fast simplicial quadrature-based finite element operators using Bernstein polynomials (Q431308)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast simplicial quadrature-based finite element operators using Bernstein polynomials |
scientific article; zbMATH DE number 6050621
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast simplicial quadrature-based finite element operators using Bernstein polynomials |
scientific article; zbMATH DE number 6050621 |
Statements
Fast simplicial quadrature-based finite element operators using Bernstein polynomials (English)
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
0.9695268
0 references
0.8773676
0 references
0.87579775
0 references
0.86784774
0 references
0 references
0.8630519
0 references
0.86208004
0 references
0.86062646
0 references
