Study on Control Algorithm for Continuous Segments Trajectory Interpolation

In CNC machining,the complexity of the part contour causes a series of problems including the repeated start-stop of the motor,low machining efficiency,and poor machining quality.To relieve those problems,a new interpolation algorithm was put forward to realize the interpolation control of continuous sections trajectory.The relevant error analysis of the algorithm was also studied.The feasibility of the algorithm was proved by machining experiment using a laser machine to carve the interpola- tion trajectory in the CNC system GT100.This algorithm effectively improved the machining efficiency and the contour quality.

C^n-CONTINUOUS B-TYPE SPLINE CURVES WITH ITSLOCALIZATION INTERPOLATION AND APPROXIMATION

This paper presents a class of Cn- continuous B- type spline curves with some paramet- ric factors.The length of their local support is equal to4.Taking the different values of the parametric factors,the curves can become free- type curves or interpolate a set of given points even mix the both cases.When the parametric factors satisfy the certain conditions,the degrees of the curves can be decreased as low as possible.Besides,when all the parametric factors tend to zero,the curves globally approximate to the control polygon.

An Optimal Feed Interpolator Based on G^2 Continuous Bézier Curves for High-Speed Machining of Linear Tool Path

A numerical control (NC) tool path of digital CAD model is widely generated as a set of short line segments in machining. However, there are three shortcomings in the linear tool path, such as discontinuities of tangency and curvature, huge number of line segments, and short lengths of line segments. These disadvantages hinder the development of high speed machining. To smooth the linear tool path and improve machining efficiency of short line segments, this paper presents an optimal feed interpolator based on G^2 continuous Bézier curves for the linear tool path. First, the areas suitable for fitting are screened out based on the geometric characteristics of continuous short segments (CSSs). CSSs in every area are compressed and fitted into a G^2 Continuous Bézier curve by using the least square method. Then a series of cubic Bézier curves are generated. However, the junction between adjacent Bézier curves is only G^0 continuous. By adjusting the control points and inserting Bézier transition curves between adjacent Bézier curves, the G^2 continuous tool path is constructed. The fitting error is estimated by the second-order Taylor formula. Without iteration, the fitting algorithm can be implemented in real-time environment. Second, the optimal feed interpolator considering the comprehensive constraints (such as the chord error constraint, the maximum normal acceleration, servo capacity of each axis, etc.) is proposed. Simulation and experiment are conducted. The results shows that the proposed method can generate smooth path, decrease the amount of segments and reduce machining time for machining of linear tool path. The proposed research provides an effective method for high-speed machining of complex 2-D/3-D profiles described by short line segments.

ON THE CONTINUITY AND DIFFERENTIABILITY OF AKIND OF FRACTAL INTERPOLATION FUNCTION

The sufficient conditions of Holder continuity of two kinds of fractal interpolation functions defined by IFS (Iterated Function System) were obtained. The sufficient and necessary condition for its differentiability was proved. Its derivative was a fractal interpolation function generated by the associated IFS, if it is differentiable.

Superconvergence of Continuous Finite Elements with Interpolated Coeffcients for Initial Value Problems of Nonlinear Ordinary Differential Equation

In this paper, n-degree continuous finite element method with interpolated coefficients for nonlinear initial value problem of ordinary differential equation is introduced and analyzed. An optimal superconvergence u-uh = O(hn+2), n ≥ 2, at (n + 1)-order Lobatto points in each element respectively is proved. Finally the theoretical results are tested by a numerical example.

Block Based Bivariate Blending Rational Interpolation via Symmetric Branched Continued Fractions

This paper constructs a new kind of block based bivariate blending rational interpolation via symmetric branched continued fractions. The construction process may be outlined as follows. The first step is to divide the original set of support points into some subsets (blocks). Then construct each block by using symmetric branched continued fraction. Finally assemble these blocks by Newton’s method to shape the whole interpolation scheme. Our new method offers many flexible bivariate blending rational interpolation schemes which include the classical bivariate Newton’s polynomial interpolation and symmetric branched continued fraction interpolation as its special cases. The block based bivariate blending rational interpolation is in fact a kind of tradeoff between the purely linear interpolation and the purely nonlinear interpolation. Finally, numerical examples are given to show the effectiveness of the proposed method.

General Structures of Block Based Interpolational Function

We construct general structures of one and two variable interpolation function, without depending on the existence of divided difference or inverse differences, and we also discuss the block based osculatory interpolation in one variable case. Clearly, our method offers marly flexible interpolation schemes for choices. Error terms for the interpolation are determined and numerical examples are given to show the effectlveness of the results.

Werner-Type Matrix Valued Rational Interpolation and Its Recurrence Algorithms

In this paper, a practical Werner-type continued fraction method for solving matrix valued rational interpolation problem is provided by using a generalized inverse of matrices. In order to reduce the continued fraction form to rational function form of the interpolants, an efficient forward recurrence algorithm is obtained.

On the Method of Multiplier-enlargement and Approximation of Unbounded Continuous Functions

By combining the classical appropriate functions “1, x, x 2” with the method of multiplier enlargement, this paper establishes a theorem to approximate any unbounded continuous functions with modified positive linear operators. As an example, Hermite Fejér interpolation polynomial operators are analysed and studied, and a general conclusion is obtained.

CONSTRUCTION OF G^2 CONTINUOUS CURVES ON SURFACE WITH PLANAR CUBIC BZIER CURVES

The problem of constructing curve on parametric surface (or surface that canbe parameterized) such that it interpolates a sequence of points with prescribed tangent directionand curvature vector (or geodesic curvature) at every point and the issue of curve blending on thiskind of surface are researched. The mapping and tangent mapping from the surface to its parametricplane are introduced and thus several conclusions with differential geometry are deduced. Based onthose conclusions, the problem of interpolating (or blending) curve on a parametric surface isconverted to a similar one on its parametric plane. The final solution curve of either interpolationor blending issue is explicit and can still be expressed by parametric form. And so, unlikeexisting methods, the presented method needs not to use any surface/ surface intersectionalgorithms, usually a troublesome process, for displaying such interpolation curve. Experimentresults show the presented methods are feasible and applicable to CAD/CAM and computer graphics

C2 Continuous Quartic Hermite Spline Curves with Shape Parameters

In order to relieve the deficiency of the usual cubic Hermite spline curves,the quartic Hermite spline curves with shape parameters is further studied in this work. The interpolation error and estimator of the quartic Hermite spline curves are given. And the characteristics of the quartic Hermite spline curves are discussed.The quartic Hermite spline curves not only have the same interpolation and continuity properties of the usual cubic Hermite spline curves, but also can achieve local or global shape adjustment and C;continuity by the shape parameters when the interpolation conditions are fixed.

Three-Dimensional Generalized Inverse Matrix Rational Interpolation

In this paper, a three dimensional matrix valued rational interpolant (TGMRI) is first constructed by making use of the generalized inverse of matrices. The interpolants are of the Thiele type branched continued fraction form, with matrix numerator and scalar denominator. Some properties of TGMRI are given. An efficient recursive algorithm is proposed. The results in the paper can be extend to n variable.

GLOBAL SMOOTHNESS PRESERVATION BY BIVARIATE INTERPOLATION OPERATORS

Extending the results of [4] in the univariate case, in this paper we prove that the bivariate interpolation polynomials of Hermite-Fejér based on the Chebyshev nodes of the first kind, those of Lagrange based on the Chebyshev nodes of second kind and ±1, and those of bivariate Shepard operators, have the property of partial preservation of global smoothness, with respect to various bivariate moduli of continuity.

Two Dual Expansions for Generalized Bivariate Thiele-Type Matrix Valued Interpolating Continued Fractions

A new method for the construction of bivariate matrix valued rational interpolants on a rectangulargrid is introduced. The rational interpolants are expressed in the continued fraction form with scalardenominator. Tile matrix quotients are based oil the generalized inverse for a matrix, Which is found to beeffective in continued fraction interpolation. In this paper, tWo dual expansions for bivariate matrix valuedThiele-type interpolating continued fractions are presented, then, tWo dual rational interpolants are definedout of them.

Four Steps Continuous Method for the Solution of <i>y″</i>= <i>f</i>(<i>x, y, y′</i>)

This paper proposes a continuous block method for the solution of second order ordinary differential equation. Collocation and interpolation of the power series approximate solution are adopted to derive a continuous implicit linear multistep method. Continuous block method is used to derive the independent solution which is evaluated at selected grid points to generate the discrete block method. The order, consistency, zero stability and stability region are investigated. The new method was found to compare favourably with the existing methods in term of accuracy.

A Parameterization Method from Conic Spline Interpolation

Interpolating a set of planar points is a common problem in CAD. Most constructions of interpolation functions are based on the parameters at the sample points. Assigning parameters to all sample points is a vital step before constructing interpolation functions. The most widely used parameterization method is accumulative chord length parameterization. In this paper, we give out a better method based on the interpolation of conics. Based on this method, a sequence of fairer Hermite curves can be constructed.

The Levels-Recursive Algorithm for Vector Valued Interpolants by Triple Branched Continued Fractions

A kind of triple branched continued fractions is defined by making use of Samel- son inverse and Thiele-type partial inverted di?erences [1]. In this paper, a levels-recursive algorithm is constructed and a numerical example is given.

New Approach to Bivariate Blending Rational Interpolants

Newton＇s polynomial interpolation may be the favorite linear interpolation,associated continued fractions interpolation is a new type nonlinear interpolation.We use those two interpolation to construct a new kind of bivariate blending rational interpolants.Characteristic theorem is discussed.We give some new blending interpolation formulae.

COMPUTATION OF VECTOR VALUED BLENDING RATIONAL INTERPOLANTS

As we know, Newton's interpolation polynomial is based on divided differ-ences which can be calculated recursively by the divided-difference scheme while Thiele'sinterpolating continued fractions are geared towards determining a rational functionwhich can also be calculated recursively by so-called inverse differences. In this paper,both Newton's interpolation polynomial and Thiele's interpolating continued fractionsare incorporated to yield a kind of bivariate vector valued blending rational interpolantsby means of the Samelson inverse. Blending differences are introduced to calculate theblending rational interpolants recursively, algorithm and matrix-valued case are dis-cussed and a numerical example is given to illustrate the efficiency of the algorithm.

The Limiting Case of Blending Differences for Bivariate Blending Continued Fraction Expansions

For a univariate function given by its Taylor series expansion, a continued fraction expansion can be obtained with the Viscovatov＇s algorithm, as the limiting value of a Thiele interpolating continued fraction or by means of the determinantal formulas for inverse and reciprocal differences with coincident data points. In this paper, both Viscovatov-like algorithms and Taylor-like expansions are incorporated to yield bivariate blending continued expansions which are computed as the limiting value of bivariate blending rational interpolants, which are constructed based on symmetric blending differences. Numerical examples are given to show the effectiveness of our methods.