DeepAI AI Chat
Log In Sign Up

Quadrature rules for C^0 and C^1 splines, a recipe

by   Helmut Ruhland, et al.

Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes S_2N, 0 and S_2N+1, 1, i.e. even and odd degree are presented. Also rules for the 2 missing spline classes S_2N-1, 0 and S_2N, 1 (the so called 1/2-rules), i.e. odd and even degree are presented. These quadrature rules are explicit in the sense, that they compute the nodes and their weights in the first/last boundary subinterval and, via a recursion the other nodes/weights, parsing from the first/last subinterval to the middle of the interval. These closed formulae are based on the semi-classical Jacobi type orthogonal polynomials.


page 1

page 2

page 3

page 4


Spline quadrature and semi-classical orthogonal Jacobi polynomials

A theory of spline quadrature rules for arbitrary continuity class in a ...

Machine Learning Discovery of Optimal Quadrature Rules for Isogeometric Analysis

We propose the use of machine learning techniques to find optimal quadra...

Gaussian quadrature rules for composite highly oscillatory integrals

Highly oscillatory integrals of composite type arise in electronic engin...

Recursive, parameter-free, explicitly defined interpolation nodes for simplices

A rule for constructing interpolation nodes for nth degree polynomials o...

Arbitrary-order asymptotic expansions of Gaussian quadrature rules with classical and generalised weight functions

Gaussian quadrature rules are a classical tool for the numerical approxi...

Uniform relations between the Gauss-Legendre nodes and weights

Three different relations between the Legendre nodes and weights are pre...

Nodes on quintic spectrahedra

We classify transversal quintic spectrahedra by the location of 20 nodes...