Fast simplicial quadrature-based finite element operators using Bernstein polynomials (Q431308): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Răzvan Răducanu / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65N30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65Y20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6050621 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
finite elements | |||
| Property / zbMATH Keywords: finite elements / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Bernstein polynomials | |||
| Property / zbMATH Keywords: Bernstein polynomials / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complexity | |||
| Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithm | |||
| Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Revision as of 22:57, 29 June 2023
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
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
