The Order of Approximation by Complex Rational Type Interpolating Operators at Fejer's Points

In this paper, supose Γ be a boundary of a Jordan domain D and Γ satisfied Альпер condition, the order that rational type interpolating operators at Fejer's points of f(z)∈C(Γ) converge to f(z) in the sense of uniformly convergence is obtained.

Rational offset approximation of rational Bézier curves

The problem of parametric speed approximation of a rational curve is raised in this paper. Offset curves are widely used in various applications. As for the reason that in most cases the offset curves do not preserve the same polynomial or rational polynomial representations, it arouses difficulty in applications. Thus approximation methods have been introduced to solve this problem. In this paper, it has been pointed out that the crux of offset curve approximation lies in the approximation of parametric speed. Based on the Jacobi polynomial approximation theory with endpoints interpolation, an algebraic rational approximation algorithm of offset curve, which preserves the direction of normal, is presented.

Muntz Rational Approximation for Special Function Classes in Orlicz Spaces

Using the method of construction, with the help of inequalities, we research the Muntz rational approximation of two kinds of special function classes, and give the corresponding estimates of approximation rates of these classes under widely con- ditions. Because of the Orlicz Spaces is bigger than continuous function space and the Lp space, so the results of this paper has a certain expansion significance.

Rational Approximation to |<i>x</i>| at Logarithmic Nodes

Based on a node group , the Newman type rational operator is constructed in the paper. The convergence rate of approximation to a class of non-smooth functions is discussed, which is regarding to X. Moreover, if the operator is constructed based on further subdivision nodes, the convergence rate is . The result in this paper is superior to the approximation results based on equidistant nodes, Chebyshev nodes of the first kind and Chebyshev nodes of the second kind.

Copositive approximation by rational functions with prescribed numerator degree

The paper proves that, if f（x） ∈ L^p[-1,1],1≤p〈∞ ,changes sign I times in （-1, 1）,then there exists a real rational function r（x） ∈ Rn^（2μ-1）l which is eopositive with f（x）, such that the following Jackson type estimate ｜｜f-r｜｜p≤Cδl^2μωφ（f,1/n）p holds, where μ is a natural number ≥3/2＋1/p, and Cδ is a positive constant depending only on δ.

MNTZ RATIONAL APPROXIMATION FOR SPECIAL FUNCTION CLASSES IN Ba[0,1] SPACES

In this paper, we research the Miintz rational approximation of two kinds of spe- cial function classes, and give the corresponding estimates of approximation rates of these classes.

Interval Bézier Surfaces Approximation of Rational Surfaces

On the basis of the perturbation, we present an approach to approximating rational surfaces by the interval Btzier surfaces using energy minimization method. The approach makes the perturbation surfaces have more restrictions than the original surfaces. It could be combined with subdivision method to obtain a piecewise interval polynomial approximation for a rational surface. The applications of this approach are illustrated too.

PADE APPROXIMANTS AS LIMITS OF RATIONAL FUNCTIONS OF BEST APPROXIMATION IN ORLICZ SPACE

In this paper, we prove that the best rational approximation of a given analytic function in Orlicz space L~*(G), where G = {|z|≤∈}, converges to the Pade approximants of the function as the measure of G approaches zero.

Optimization for ASP flooding based on adaptive rationalized Haar function approximation

This paper presents an adaptive rationalized Haar function approximation method to obtain the optimal injection strategy for alkali-surfactant-polymer(ASP) flooding. In this process, the non-uniform control vector parameterization is introduced to convert original problem into a multistage optimization problem, in which a new normalized time variable is adopted on the combination of the subinterval length. Then the rationalized Haar function approximation method, in which an auxiliary function is introduced to dispose path constraints, is used to transform the multistage problem into a nonlinear programming. Furthermore, an adaptive strategy proposed on the basis of errors is adopted to regulate the order of Haar function vectors. Finally, the nonlinear programming for ASP flooding is solved by sequential quadratic programming. To illustrate the performance of proposed method,the experimental comparison method and control vector parameterization(CVP) method are introduced to optimize the original problem directly. By contrastive analysis of results, the accuracy and efficiency of proposed method are confirmed.

A Rational Approximation of the Fourier Transform by Integration with Exponential Decay Multiplier

Recently we have reported a new method of rational approximation of the sinc function obtained by sampling and the Fourier transforms. However, this method requires a trigonometric multiplier that originates from the shifting property of the Fourier transform. In this work, we show how to represent the Fourier transform of a function f(t) in form of a ratio of two polynomials without any trigonometric multiplier. A MATLAB code showing algorithmic implementation of the proposed method for rational approximation of the Fourier transform is presented.

APPROXIMATION BY FABER-LAURENT RATIONAL FUNCTIONS IN THE MEAN OF FUNCTIONS OF CLASS LP(T) WITH 1

Let Γ be a regular curve and Lp (Γ), 1<p<+∞. be the class of all complex - valued functions f de-fined on Γ which are such that |f|p is mtegrabie in sense of Lebesgue. In this work, we define the k th p-Fabcrpolynomial F k,p (z),the kth p-Faber principle part F k.p (1/z) for Γ , and defined the nth p-Fcber- Laurent rational function Rn.p (f, z) and p- generalized modulus of continuity Ωp(f, t) of a function f of Lp(Γ) We inves-tigate some properties of Fk,p (z) and Fk.p (1/z). And then we prove a direct theorem characterizing the degree of approximation with respect to Ω (. , t) in the mean of functions of Lp(Γ) by the rational junctions Rn.p (. . z).

RATIONAL FUNCTIONS OF BEST UNIFORM APPROXIMATION AND HOLOMORPHIC CONTINUATION OF FUNCTIONS

Let f be a function, continuous and real valued on the segment △,△ (-∞,∞) and {Rn} be the sequence of the rational functions of best uniform approximation to fon △ of order (n,n). In the present work, the convergence of {Rn} in the complex plane is considered for the special caseswhen the poles (or the zeros, respectively) of {Rn} accumulate in the terms of weak convergence of measures to acompact set of zera capacity.As a consequence, sufficient conditions for the holomorphic and the meromorphic continuability of fare given.

APPROXIMATE COMMON DIVISORS OF POLYNOMIALS AND DEGREE REDUCTION FOR RATIONAL CURVES

Abstract This paper deals with how to perturb a given set of polynomials so as to include a common linear factor. An algorithm is derived for determining such a set of perturbation polynomials which are subject to certain constrains at the endpoints of a prescribed parametric interval and minimized in a certain sense. This result can be combined with subdivision technique to obtain a continuous piecewise approximation to a rational curve.

APPROXIMATION OF INTERVAL BEZIER SURFACES

Based on the conception of perturbation, an approach to the interval Bezier surfaces approximating ra- tional surfaces is presented using the energy minimization method. The method places more restrictions on the perturbation surfaces than the original surfaces. The applications of the approach are also presented. Experimen- tal result is combined with the subdivision method to obtain a piecewise interval polynomial approximation for a rational surface.

Improved Oustaloup approximation of fractional-order operators using adaptive chaotic particle swarm optimization

A rational approximation method of the fractional-order derivative and integral operators is proposed. The turning fre- quency points are fixed in each frequency interval in the standard Oustaloup approximation. In the improved Oustaloup method, the turning frequency points are determined by the adaptive chaotic particle swarm optimization （PSO）. The average velocity is proposed to reduce the iterations of the PSO. The chaotic search scheme is combined to reduce the opportunity of the premature phenomenon. Two fitness functions are given to minimize the zero-pole and amplitude-phase frequency errors for the underlying optimization problems. Some numerical examples are compared to demonstrate the effectiveness and accuracy of this proposed rational approximation method.

ON NEWMAN-TYPE RATIONAL INTERPOLATION TO |x| AT THE CHEBYSHEV NODES OF THE SECOND KIND

Recently Brutman and Passow considered Newman-type rational interpolation to ｜x｜ induced by arbitrary set of symmetric nodes in [-1,1] and gave the general estimation of the approximation error.By their methods one could establish the exact order of approximation for some special nodes. In the present paper we consider the special case where the interpolation nodes are the zeros of the Chebyshev polynomial of the second kind and prove that in this case the exact order of approximation is O（1/n｜nn）

A RATIONAL SEPCTRAL METHOD FOR SINGULAR DIFFERENTIAL EQUATIONS

An orthogonal system of rational functions is derived from the mapped Laguerre polynomials,which is used for numerical solution of singular differential equations.A model problem is considered.A multiple-step algorithm is developed to implement this method.Numerical results show the efficiency of this new approach.

A UNIFIED APPROACH TO CERTAIN PROBLEMS OF BEST LOCAL APPROXIMATION

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables.Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.

Asymptotic Property of Approximation to x~αsgnx by Newman Type Operators

The approximation of ｜x｜ by rational functions is a classical rationalproblem. This paper deals with the rational approximation of the function xasgnx, which equals ｜x｜ if α=1. We construct a Newman type operator rn（x） and show max｜x｜≤1{｜x^αsgnx-rn（x）｜}-Cn-α/2e-√2nα where C is a constant depending on α.

Approximation Properties of Newman Type Interpolation Rational Functions with Fewer Nodes

In the present note,we consider the problem:how many interpolation nodes can be deleted from the Newman-type rational function such that the convergence rate still achieve.