Log In Sign Up

Polyhedral Spline Finite Elements

by   Guohui Zhao, et al.

Spline functions have long been used in numerically solving differential equations. Recently it revives as isogeometric analysis, which uses NURBS for both parametrization and element functions. In this paper, we introduce some multivariate spline finite elements on general partitions. These splines are constructed by mollifying splines of low smooth order with B-splines. They have both high smooth order and strong approximation power. The low smooth order splines can be chosen flexibly, for example polynomials on individual cells of general polyhedral partitions. Evaluation of such splines is not difficult, so the obtained spline elements are suitable for the collocation method and adaptive computation.


page 1

page 2

page 3

page 4


C^s-smooth isogeometric spline spaces over planar multi-patch parameterizations

The design of globally C^s-smooth (s ≥ 1) isogeometric spline spaces ove...

Analysis-suitable T-splines: characterization, refineability, and approximation

We establish several fundamental properties of analysis-suitable T-splin...

A spline-based spatial impulse response simulator

The spatial impulse response (SIR) method is a well-known approach to ca...

Estimating smooth and sparse neural receptive fields with a flexible spline basis

Spatio-temporal receptive field (STRF) models are frequently used to app...

A characterization of supersmoothness of multivariate splines

We consider spline functions over simplicial meshes in R^n. We assume th...

Adaptive spline fitting with particle swarm optimization

In fitting data with a spline, finding the optimal placement of knots ca...

Spline Moment Models for the one-dimensional Boltzmann-BGK equation

We introduce Spline Moment Equations (SME) for kinetic equations using a...