The Least-squares Fitting of Cubic Spline Surfaces to General Data Sets

This paper presents a computational method, with several variants,for fitting bicubic splines by least squares to data given atarbitrary points. Products of B-splines are used in the representationof the bicubic splines. The resulting observation equationsare solved by means of Householder transformations. A stablemethod for imposing linear equality constraints is also described.The methods take account of rank-deficiency and are readilyextended to more dimensions.     

Least-Squares Fitting of Algebraic Spline Surfaces

We present an algorithm for fitting implicitly defined algebraic spline surfaces to given scattered data. By simultaneously approximating points and associated normal vectors, we obtain a method which is computationally simple, as the result is obtained by solving a system of linear equations. In addition, the result is geometrically invariant, as no artificial normalization is introduced. The potential applications of the algorithm include the reconstruction of free-form surfaces in reverse engineering. The paper also addresses the generation of exact error bounds, directly from the coefficients of the implicit representation.     

The Rounded Cubic Spline

A modification to the conventional spline interpolation methodsis suggested. The new method results in a function which iscontinuous in all higher-order derivatives. This results usuallyin a higher precision as is shown in many examples. The disadvantages are, however, the need of a high precisioncomputer and also the extra computer time involved.     

Hermite Interpolation of Data Sets by Minimal Spline Spaces

Hermite interpolation of 2n + k data by spline spaces of order k with n variable knots counting multiplicities is studied. A characterization of the minimal spline spaces which admit a solution of the interpolation problem is obtained. A sufficient condition on uniqueness of interpolating spline functions is given.     

基于最小一乘准则的三次样条对利率期限结构的拟合

将基于最小一乘准则的三次样条函数法应用于拟合在上海证券交易所交易的国债的利率期限结构,并与传统的最小二乘法进行比较。样本外预测结果显示,稳健的最小一乘方法能有效的降低异常点的干扰,弥补最小二乘法的不足,提高预测的精度。     

Cubic Spline Data Reduction Choosing the Knots from a Third Derivative Criterion

This paper presents a data reduction method for functional data. Starting with noisy or not noisy data, we first define a function f, called the reference function, as a cubic smoothing spline which is supposed to have the global form of the data. This reference function is then used to locate the knots of the final approximating spline by using a criterion based on the third derivative of f. Then, the least-squares spline approximating all the data is derived with these knots. Numerical results show the effectiveness of the method.     

一类分层三角剖分下三次样条空间的维数

本文定义了平面单连通多边形域的一类较任意的三角剖分－分层三角剖分，并通过分析二元样条的积分协调条件，确定了分层三角剖分卜三次Ｃ^１作条函数空间的维数．     

Rigidity of Stable Marginally Outer Trapped Surfaces in Initial Data Sets

In this article, we investigate the restrictions imposed by the dominant energy condition (DEC) on the topology and conformal type of possibly non-compact marginally outer trapped surfaces (thus extending Hawking’s classical theorem on the topology of black holes). We first prove that an unbounded, stable marginally outer trapped surface in an initial data set (M, g, k) obeying the dominant energy condition is conformally diffeomorphic to either the plane \({\mathbb{C}}\) or to the cylinder \({\mathbb{A}}\) and in the latter case infinitesimal rigidity holds. As a corollary, when the DEC holds strictly, this rules out the existence of trapped regions with cylindrical boundary. In the second part of the article, we restrict our attention to asymptotically flat data (M, g, k) and show that, in that setting, the existence of an unbounded, stable marginally outer trapped surface essentially never occurs unless in a very specific case, since it would force an isometric embedding of (M, g, k) into the Minkowski spacetime as a space-like slice.     

Increased Accuracy Cubic Spline Solutions to Two-Point Boundary Value Problems

The relation between finite difference approximation and cubicspline solutions of a two-point boundary value problem for thedifferential equation y' +f(x)y^'+g(x)y = r(x) has been consideredin a previous paper. The present paper extends the analysisto the integral equation formulation of the problem. It is shownthat an improvement in accuracy (local truncation error O(h⁶)rather than O(h⁴)) now results from a cubic spline approximationand that for the particular case f(x) 0 the resulting recurrencerelations have a form and accuracy similar to the well-knownNumerov formula. For this case also a formula with local truncationerror O(h⁸) is derived.     

The General Problem of Polynomial Spline Interpolation

We study the general problem of interpolation by polynomial splines and consider the construction of such splines using the coefficients of expansion of a certain derivative in B-splines. We analyze the properties of the obtained systems of equations and estimate the interpolation error.     

A General Hybrid Optimization Strategy for Curve Fitting in the Non-uniform Rational Basis Spline Framework

In this paper, a general methodology to approximate sets of data points through Non-uniform Rational Basis Spline (NURBS) curves is provided. The proposed approach aims at integrating and optimizing the full set of design variables (both integer and continuous) defining the shape of the NURBS curve. To this purpose, a new formulation of the curve fitting problem is required: it is stated in the form of a constrained nonlinear programming problem by introducing a suitable constraint on the curvature of the curve. In addition, the resulting optimization problem is defined over a domain having variable dimension, wherein both the number and the value of the design variables are optimized. To deal with this class of constrained nonlinear programming problems, a global optimization hybrid tool has been employed. The optimization procedure is split in two steps: firstly, an improved genetic algorithm optimizes both the value and the number of design variables by means of a two-level Darwinian strategy allowing the simultaneous evolution of individuals and species; secondly, the optimum solution provided by the genetic algorithm constitutes the initial guess for the subsequent gradient-based optimization, which aims at improving the accuracy of the fitting curve. The effectiveness of the proposed methodology is proven through some mathematical benchmarks as well as a real-world engineering problem.     

一类三角域上的三次样条插值(英文)

In this paper, we consider spaces of cubic C^1-spline on a class of triangulations. By using the inductive algorithm, the posed Lagrange interpolation sets are constructed for cubic spline space. It is shown that the class of triangulations considered in this paper are nonsingular for S1/3 spaces. Moreover, the dimensions of those spaces exactly equal to L. L. Schuraaker＇s low bounds of the dimensions. At the end of this paper, we present an approach to construct triangulations from any scattered planar points, which ensures that the obtained triangulations for S1/3 space are nonsingular.     

三次多项式样条解一类四阶边值问题

应用三次多项式样条函数解一组四阶单侧、障碍、接触边值问题,取半结点为网格点,并增加了边界方程,应用方法解文献中的数值例子,说明了方法的高效性,数值结果也显示了方法的优越性.     

Archimedean Copula数据拟合

给出了选择较优Archimedean Copula相依结构的一般过程,并结合中国股市的实际数据作了分析,通过不同的标准得到了拟合深圳成份A股与深圳成份B股指数的较好的Archimedean Copula,而且还发现利用Copula刻画相依结构比传统的线性相关系数具有更多的优越性.     

On the Construction of Optimal Monotone Cubic Spline Interpolations

In this paper we derive necessary optimality conditions for an interpolating spline function which minimizes the Holladay approximation of the energy functional and which stays monotone if the given interpolation data are monotone. To this end optimal control theory for state-restricted optimal control problems is applied. The necessary conditions yield a complete characterization of the optimal spline. In the case of two or three interpolation knots, which we call thelocalcase, the optimality conditions are treated analytically. They reduce to polynomial equations which can very easily be solved numerically. These results are used for the construction of a numerical algorithm for the optimal monotone spline in the general (global) case via Newton's method. Here, the local optimal spline serves as a favourable initial estimation for the additional grid points of the optimal spline. Some numerical examples are presented which are constructed by FORTRAN and MATLAB programs.     

A Fast Parallel Algorithm of Bivariate Spline Surfaces

1.Introducti0llIthasbeenshownl1]thatbivariateB-splineisaveryusefult0olf0rdesitwngsurfacemodeiling.Onemalndifficultyinpractice,however,istodevelopanefficientalgorithmforevalatinganddisplayingtheresultingsurface.Infact,foragivenpartitionflabivaxiatesplineinthespaces:(fl)isapiecewisebivariatepolyn0mialoft0taldegreekwithglobalcontinuitydegreep.ItmeansthatineachsubdomainthesurfacecanberepresentedasaBernsteinBezierform.Byusingwell-knownsubdivisi0nteclmiqueI2]onemaygiveanalgorithmf0rB-Bsurfaceinea…     

Rigidity of Hyperbolic Sets on Surfaces

Given a hyperbolic invariant set of a diffeomorphism on a surface,it is proved that, if the holonomies are sufficiently smooth,then the diffeomorphism on the hyperbolic invariant set is rigidin the sense that it is C¹⁺ conjugate to a hyperbolic affinemodel.     

An Analysis of Two Algorithms for Shape-Preserving Cubic Spline Interpolation

The use of polynomial splines as a basis for the interpolationof discrete data can be theoretically justified by a minimumprinciple. It is natural to apply this principle also if shapepreserving is added as a constraint, although the constructionprocess is then nonlinear. We discuss two algorithms for theconstruction of the cubic spline interpolant under the constraintof positivity or monotonicity, and give a detailed convergenceanalysis. Numerical tests illustrate that analysis.     

Minimum Power Dominating Sets of Random Cubic Graphs

We present two heuristics for finding a small power dominating set of cubic graphs. We analyze the performance of these heuristics on random cubic graphs using differential equations. In this way, we prove that the proportion of vertices in a minimum power dominating set of a random cubic graph is asymptotically almost surely at most 0.067801. We also provide a corresponding lower bound of using known results on bisection width.