We present a numerical code for the computation of nodes and weights of a low-cardinality positive quadrature formula on spherical triangles, nearly exact for polynomials of a given degree. The algorithm is based on subperiodic trigonometric Gaussian quadrature for planar elliptical sectors and on Caratheodory–Tchakaloff quadrature compression via NNLS.
Near-algebraic Tchakaloff-like quadrature on spherical triangles
Sommariva A.;Vianello M.
2021
Abstract
We present a numerical code for the computation of nodes and weights of a low-cardinality positive quadrature formula on spherical triangles, nearly exact for polynomials of a given degree. The algorithm is based on subperiodic trigonometric Gaussian quadrature for planar elliptical sectors and on Caratheodory–Tchakaloff quadrature compression via NNLS.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
spheretri.pdf
accesso aperto
Tipologia:
Preprint (submitted version)
Licenza:
Accesso libero
Dimensione
329.39 kB
Formato
Adobe PDF
|
329.39 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
