In this paper we provide a tetrahedra-free algorithm to compute low-cardinality quadrature rules with a given degree of polynomial exactness, positive weights and interior nodes on a polyhedral element with arbitrary shape. The key tools are the notion of Tchakaloff discretization set and the solution of moment-matching equations by Lawson-Hanson iterations for NonNegative Least-Squares. Several numerical tests are presented. The method is implemented in Matlab as open-source software.
TetraFreeQ: Tetrahedra-free quadrature on polyhedral elements
Sommariva A.;Vianello M.
2023
Abstract
In this paper we provide a tetrahedra-free algorithm to compute low-cardinality quadrature rules with a given degree of polynomial exactness, positive weights and interior nodes on a polyhedral element with arbitrary shape. The key tools are the notion of Tchakaloff discretization set and the solution of moment-matching equations by Lawson-Hanson iterations for NonNegative Least-Squares. Several numerical tests are presented. The method is implemented in Matlab as open-source software.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
tetrafreeq.pdf
accesso aperto
Descrizione: preprint
Tipologia:
Preprint (submitted version)
Licenza:
Accesso libero
Dimensione
723.37 kB
Formato
Adobe PDF
|
723.37 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
