No full-text available
To read the full-text of this research,
you can request a copy directly from the author.
... Indeed, despite of the relevance of spherical triangles in the field of Geomathematics, the topic of numerical quadrature on spherical triangles, starting from a classical paper by K. Atkinson in the '80s [3], has received some attention in the literature of the last decades, with however a substantial lack of easily available numerical software (at least to our knowledge); cf. [4,5,6,7] and [16, §7.2] for an overview. Some of the methods have been developed in the framework of numerical PDEs on the sphere, cf. ...
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.
... Indeed, despite of the relevance of spherical triangles in the field of Geomathematics, the topic of numerical quadrature on spherical triangles, starting from a classical paper by K. Atkinson in the '80s [3], has received some attention in the literature of the last decades, with however a substantial lack of easily available numerical software (at least to our knowledge); cf. [4,5,6,7] and [16, §7.2] for an overview. Some of the methods have been developed in the framework of numerical PDEs on the sphere, cf. ...
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.
ResearchGate has not been able to resolve any references for this publication.