# Building Gaussian-type quadrature schemes with Zernike polynomials

The abscissas for Gauss quadrature are given by the zeros of the Legendre polynomials. The Legendre polynomials form an orthogonal set over $$[-1, 1]$$, and it is shown in (for instance) Kress that the zeros of a set of orthogonal polynomials give the abscissas for Gauss-type quadrature schemes.

Does this result hold in higher dimensions? In particular, I am interested in where the zeros of the Zernike polynomials can be used to generate a 2D Gaussian-type quadrature scheme over the unit disk. If so, references are appreciated.

Edit: Since the answers have been posted, a new paper presents results in this direction, see here.

Yes, one can extend the Gaussian quadrature (in one dimension) to multiple dimensions. Often this is called cubature. Much work on this has been done by Ronald Cools and collaborators (see his Encyclopedia of Cubature Formulae).

A nice paper for your application (integration on the unit disk) is A survey of known and new cubature formulas for the unit disk. It explains how to generate cubature formulas and provides links to sets of nodes/weights for different degrees. Especially the reference Symmetric quadrature formulas over a unit disk mentioned therein is of use for you.

Also the online article by Pavel Holoborodko is good introductory read. He explains the two approaches: direct derivation and product rule (as mentioned by Reid Atcheson).

Unfortunately the 1D reasoning will not directly carry into 2D and beyond. Depending on the domain for your integral, you will have considerable latitude in the node choice - but of course the quadrature weights can be generated from polynomials as usual. The closest you could achieve to a classic Gaussian-type rule is to coordinate-transform your domain to a product of 1D intervals and construct the rule by tensor product and coordinate transform back to get a rule for the domain of interest. This will generally not be an exact for polynomials, but should still retain good convergence rates provided the Jacobian of the coordinate transformation is well behaved.

Put briefly: in 1D you have a nice alignment of many goals for a quadrature rule in that they can be simultaneously achieved with a single rule.

1. semi-analytic expression for the rule (e.g. zeros of orthogonal polynomials)
2. Stability of rule (positive weights)
3. Symmetry properties
4. Fast convergence (e.g. exact on polynomials below a certain order)

It turns out that in 1D, all four of these conditions may be satisfied simultaneously with Gaussian quadrature rules. In 2D and beyond one must generally trade between the above features. For example often the fastest converging rules (those satisfying criterion (4)) can be incredibly expensive to compute, and often fail in (2) and (3). Rules that satisfy (1) (such as my example using coordinate transformations) often fail (2),(3) and (4).

• Do you know of a review paper which gives more examples of the tradeoffs between 1,2,3, and 4? It seems like the review article doi.org/10.1007/BF03012263 lists quite a few rules which satisfy all four desirable properties. Dec 14 '17 at 21:43
• Could you update the link? It doesn't seem to work for me. I was speaking in general of course. It may be possible to achieve all four of these conditions for specific cases. In other specific cases it's not possible, but not a barrier to producing practical quadrature rules. For example simplices in 2D+ produce linear Jacobians, therefore it's possible to precompute very good quadrature rules in advance on a reference simplex, then coordinate-transform the result to general simplices without loss of quality of the rule. This is used in finite element analysis constantly. Dec 15 '17 at 16:32