Closed formulas and a recursion produce Gaussian or one-parameter-optimal quadrature nodes and weights for C0 and C1 spline spaces on non-uniform, asymmetric partitions.
Explicit Gaussian quadrature rules for cubic splines with non-uniform knot sequences
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We provide explicit expressions for quadrature rules on the space of $C^1$ cubic splines with non-uniform, symmetrically stretched 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. Numerical experiments validating the theoretical results and the error estimates of the quadrature rules are also presented.
fields
math.NA 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quadrature rules for $C^0$ and $C^1$ splines, a recipe
Closed formulas and a recursion produce Gaussian or one-parameter-optimal quadrature nodes and weights for C0 and C1 spline spaces on non-uniform, asymmetric partitions.