Weighted Extended B-Spline Approximation of Dirichlet Problems

Authors:
Klaus Höllig;Ulrich Reif;Joachim Wipper
Affiliations:
-;-;-
Venue:
SIAM Journal on Numerical Analysis
Year:
2001

Citing 0
Cited 15

Error estimates for the web-Spline method

Mathematical Methods for Curves and Surfaces
Nonuniform web-splines

Computer Aided Geometric Design
Weighted extended B-spline method for the approximation of the stationary Stokes problem

Journal of Computational and Applied Mathematics
Powell-Sabin splines with boundary conditions for polygonal and non-polygonal domains

Journal of Computational and Applied Mathematics
Streaming multigrid for gradient-domain operations on large images

ACM SIGGRAPH 2008 papers
Stability of tensor product B-splines on domains

Journal of Approximation Theory
Transfinite mean value interpolation

Computer Aided Geometric Design
Field modeling with sampled distances

Computer-Aided Design
Transfinite mean value interpolation in general dimension

Journal of Computational and Applied Mathematics
Weighted extended B-spline method for the approximation of the stationary Stokes problem

Journal of Computational and Applied Mathematics
Constructing A-spline weight functions for stable WEB-spline finite element methods

Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
3D Composite Finite Elements for Elliptic Boundary Value Problems with Discontinuous Coefficients

SIAM Journal on Scientific Computing
Finite element analysis with b-splines: weighted and isogeometric methods

Proceedings of the 7th international conference on Curves and Surfaces
Editorial

Advances in Data Analysis and Classification
H2 regularity properties of singular parameterizations in isogeometric analysis

Graphical Models

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe a new finite element method which uses weighted extended B-splines on a regular grid as basis functions for solving Dirichlet problems on bounded domains in arbitrary dimensions. This web-method does not require any grid generation and can be implemented very efficiently. It yields smooth, high order accurate approximations with relatively low dimensional subspaces.