• Corpus ID: 118286453

Gaussian quadrature rules for $C^1$ quintic splines

@article{Bartovn2015GaussianQR,
  title={Gaussian quadrature rules for \$C^1\$ quintic splines},
  author={Michael Bartovn and Rachid Ait-Haddou and Victor M. Calo},
  journal={arXiv: Numerical Analysis},
  year={2015}
}
We provide explicit expressions for quadrature rules on the space of $C^1$ quintic splines with uniform knot sequences over finite domains. The quadrature nodes and weights are derived via an explicit recursion that avoids an intervention of any numerical solver and the rule is optimal, that is, it requires the minimal number of nodes. For each of $n$ subintervals, generically, only two nodes are required which reduces the evaluation cost by $2/3$ when compared to the classical Gaussian… 

Figures and Tables from this paper

Optimal quadrature rules for isogeometric analysis

We introduce optimal quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiness matrices. Using the homotopy continuation concept [6] that

PetIGA: High-Performance Isogeometric Analysis

Quadrature Rules for C^0 and C^1 Splines, a Recipe

These closed formulae are based on the semi-classical Jacobi type orthogonal polynomials and 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 subintervals to the “middle” of the interval.

References

SHOWING 1-10 OF 26 REFERENCES

Explicit Gaussian quadrature rules for cubic splines with non-uniform knot sequences

The quadrature nodes and weights are derived via an explicit recursion that avoids an intervention of any numerical solver and the rule is optimal, that is, it requires minimal number of nodes.

Error Bounds for Gauss Type Quadrature Formulas Related to Spaces of Splines with Equidistant Knots

Error bounds for the Gauss type quadrature formulae QGn, QLn+1 and QRn+1 (Gauss, Lobatto and Radau formulae) related to the spaces of polynomial spline functions of degree r?1 with equidistant knots

A quadrature-based approach to improving the collocation method

SummaryThe collocation method is a popular method for the approximate solution of boundary integral equations, but typically does not achieve the high order of convergence reached by the Galerkin

Computation of the solutions of nonlinear polynomial systems

Isogeometric Discrete Differential Forms in Three Dimensions

The key point of the analysis is the definition of suitable projectors that render the diagram commutative, and the theory is then applied to the numerical approximation of Maxwell source problems and eigenproblems.

Geometric constraint solver using multivariate rational spline functions

A new approach to building a solver for a set of geometric constraints represented by multivariate rational functions, formulated using inequalities as well as equalities is presented.

Error Bounds for Optimal Definite Quadrature Formulae

Definite quadrature formulae are used to obtain inclusions for the integral of a function f for which f(r) has no sign change. In this paper, error bounds for optimal definite quadrature formulae for

On certain definite quadrature formulae