Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Günther Nürnberger"'
Autor:
Michael A. Matt, Günther Nürnberger
Publikováno v:
Journal of Approximation Theory. 162:494-511
We describe a local Lagrange interpolation method using cubic (i.e. non-tensor product) C^1 splines on cube partitions with five tetrahedra in each cube. We show, by applying a complex proof, that the interpolation method is local, stable, has optima
Publikováno v:
Journal of Approximation Theory. 160:89-102
We describe an algorithm for constructing a Lagrange interpolation pair based on C^1 cubic splines defined on tetrahedral partitions. In particular, given a set of points V@?R^3, we construct a set P containing V and a spline space S"3^1(@?) based on
Publikováno v:
Journal of Computational and Applied Mathematics. 216:344-363
We develop a local Lagrange interpolation scheme for quartic C^1 splines on triangulations. Given an arbitrary triangulation @D, we decompose @D into pairs of neighboring triangles and add ''diagonals'' to some of these pairs. Only in exceptional cas
Publikováno v:
Mathematics of Computation. 77:1017-1037
A trivariate Lagrange interpolation method based on C 1 cubic splines is described. The splines are defined over a special refinement of the Freudenthal partition of a cube partition. The interpolating splines are uniquely determined by data values,
Publikováno v:
SIAM Journal on Mathematical Analysis. 38:347-367
We analyze the structure of trivariate C1 splines on uniform tetrahedral partitions $\Delta$. The Freudenthal partitions $\Delta$ are obtained from uniform cube partitions by using three planes with a common line to subdivide every cube into six tetr
Publikováno v:
Constructive Approximation. 23:33-59
We describe a method which can be used to interpolate function values at a set of scattered points in a planar domain using bivariate polynomial splines of any prescribed smoothness. The method starts with an arbitrary given triangulation of the data
Publikováno v:
Computer Aided Geometric Design. 22:221-249
A quasi-interpolation method for quadratic piecewise polynomials in three variables is described which can be used for the efficient reconstruction and visualization of gridded volume data. The Bernstein-Bezier coefficients of the splines are immedia
Autor:
Günther Nürnberger, Frank Zeilfelder
Publikováno v:
Advances in Computational Mathematics. 21:381-419
We develop the first local Lagrange interpolation scheme for C1-splines of degree q≥3 on arbitrary triangulations. For doing this, we use a fast coloring algorithm to subdivide about half of the triangles by a Clough–Tocher split in an appropriat
Publikováno v:
Advances in Computational Mathematics. 21:357-380
We describe local Lagrange interpolation methods based on C1 cubic splines on triangulations obtained from arbitrary strictly convex quadrangulations by adding one or two diagonals. Our construction makes use of a fast algorithm for coloring quadrang
Autor:
Oleg Davydov, Günther Nürnberger
Publikováno v:
Journal of Computational and Applied Mathematics. 126(1-2):159-183
Let Δ be an arbitrary regular triangulation of a simply connected compact polygonal domain Ω⊂R2 and let Sq1(Δ) denote the space of bivariate polynomial splines of degree q and smoothness 1 with respect to Δ. We develop an algorithm for construc