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.

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.

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.

PIECEWISE RATIONAL APPROXIMATIONS OF REAL ALGEBRAIC CURVES

We use a combination of both algebraic and numerical techniques to construct a C-1-continuous, piecewise (m, n) rational epsilon-approximation of a real algebraic plane curve of degree d. At singular points we use the classical Weierstrass Preparation Theorem and Newton power series factorizations, based on the technique of Hensel lifting. These, together with modified rational Pade approximations, are used to efficiently construct locally approximate, rational parametric representations for all real branches of an algebraic plane curve. Besides singular points we obtain an adaptive selection of simple points about which the curve approximations yield a small number of pieces yet achieve C-1 continuity between pieces. The simpler cases of C-1 and C-0 continuity are also handled in a similar manner. The computation of singularity, the approximation error bounds and details of the implementation of these algorithms are also provided.

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.

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.

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.

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 α.

A structural topological optimization method for multi-displacement constraints and any initial topology configuration

In density-based topological design, one expects that the final result consists of elements either black （solid material） or white （void）, without any grey areas. Moreover, one also expects that the optimal topology can be obtained by starting from any initial topology configuration. An improved structural topological optimization method for multidisplacement constraints is proposed in this paper. In the proposed method, the whole optimization process is divided into two optimization adjustment phases and a phase transferring step. Firstly, an optimization model is built to deal with the varied displacement limits, design space adjustments, and reasonable relations between the element stiffness matrix and mass and its element topology variable. Secondly, a procedure is proposed to solve the optimization problem formulated in the first optimization adjustment phase, by starting with a small design space and advancing to a larger deign space. The design space adjustments are automatic when the design domain needs expansions, in which the convergence of the proposed method will not be affected. The final topology obtained by the proposed procedure in the first optimization phase, can approach to the vicinity of the optimum topology. Then, a heuristic algorithm is given to improve the efficiency and make the designed structural topology black/white in both the phase transferring step and the second optimization adjustment phase. And the optimum topology can finally be obtained by the second phase optimization adjustments. Two examples are presented to show that the topologies obtained by the proposed method are of very good 0/1 design distribution property, and the computational efficiency is enhanced by reducing the element number of the design structural finite model during two optimization adjustment phases. And the examples also show that this method is robust and practicable.

CALCULATION OF COUPLED PROBLEM BETWEEN TEMPERATURE AND PHASE TRANSFORMATION DURING GAS QUENCHING IN HIGH PRESSURE

The gas quenching is a modern, effective processing technology. On the basis of nonlinear surface heat-transfer coefficient obtained by Cheng during the gas quenching, the coupled problem between temperature and phase transformation during gas quenching in high pressure was simulated by means of finite element method. In the numerical calculation, the thermal physical properties were treated as the functions of temperature and the volume fraction of phase constituents. In order to avoid effectual ＂oscillation＂ of the numerical solutions under smaller time step, the Norsette rational approximate method was used.

Mathematical theory of signal analysis vs. complex analysis method of harmonic analysis

We present recent work of harmonic and signal analysis based on the complex Hardy space approach.

MATCHING PURSUITS AMONG SHIFTED CAUCHY KERNELS IN HIGHER-DIMENSIONAL SPACES

Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a realization of matching pursuits among shifted Cauchy kernels in higher-dimensional spaces. It offers a method to process signals in arbitrary dimensions.

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

Approximation to the function ｜x｜ plays an important role in approximation theory. This paper studies the approximation to the function xαsgn x, which equals ｜x｜ if α = 1. We construct a Newman Type Operator rn（x） and prove max ｜x｜≤1｜xαsgn x-rn（x）｜～Cn1/4e-π1/2（1/2）αn.

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.

Design of Non-rational MIMO Feedback Systems with Inputs and Outputs Satisfying Certain Bounding Conditions by Using Rational Approximants

When a feedback system has components described by non-rational transfer functions, a standard practice in designing such a system is to replace the non-rational functions with rational approximants and then carry out the design with the approximants by means of a method that copes with rational systems. In order to ensure that the design carried out with the approximants still provides satisfactory results for the original system, a criterion of approximation should be explicitly taken into account in the design formulation. This paper derives such a criterion for multi-input multi-output（MIMO） feedback systems whose design objective is to ensure that the absolute values of every error and every controller output components always stay within prescribed bounds whenever the inputs satisfy certain bounding conditions. The obtained criterion generalizes a known result which was derived for single-input single-output（SISO） systems; furthermore, for a given rational approximant matrix, it is expressed as a set of inequalities that can be solved in practice. Finally, a controller for a binary distillation column is designed by using the criterion in conjunction with the method of inequalities. The numerical results clearly demonstrate that the usefulness of the criterion in obtaining a design solution for the original system.

THE STEP-TRANSITION OPERATORS FOR MULTI-STEP METHODS OF ODE'S

In this paper, we propose a new definition of symplectic multistep methods. This definition differs from the old ones in that it is given via the one step method defined directly on M which is corresponding to the m step scheme defined on M while the old definitions are given out by defining a corresponding one step method on M × M ×…× M = Mm with a set of new variables. The new definition gives out a steptransition operator g: M → M. Under our new definition, the Leap-frog method is symplectic only for linear Hamiltonian systems. The transition operator g will be constructed via continued fractions and rational approximations.

A new algorithm for the extraction of the surface waves for the Green's function in layered dielectrics

There exist the complicated waveguide modes as well as the surface waves in the electromagnetic field induced by a horizontal electric dipole in layered lossless dielectrics between two ground planes. In spectral domain, all these modes can be characterized by the rational parts with the real poles of the vector and scalar potentials. The accurate extraction of these modes plays an important role in the evaluation of the Green's function in spatial domain. In this paper, a new algorithm based on rational approximation is presented, which can accurately extract all the real poles and the residues of each pole simultaneously. Thus, we can get all the surface wave modes and waveguide modes, which is of great help to the calculation of the spatial domain Green's function. The numerical results demonstrated the accuracy and efficiency of the proposed method.

Some Techniques for Computing Wave Propagation in Optical Waveguides

Optical wave-guiding structures that are non-uniform in the propagation direction are fundamental building blocks of integrated optical circuits.Numerical simulation of lightwaves propagating in these structures is an essential tool to engineers designing photonic components.In this paper,we review recent developments in the most widely used simulation methods for frequency domain propagation problems.

A Class of Multiderivative Hybrid One-step Methods

This paper presents a class of hybrid one-step methods that are obtained by using Cramer's rule and rational approximations to function exp(q). The algorithms fall into the catalogue of implicit formula, which involves sth order derivative and s+1 free parameters. The order of the algorithms satisfies s+1≤p≤2s+2. The stability of the methods is also studied, necessary and sufficient conditions for A-stability and L-stability are given. In addition, some examples are also given to demonstrate the method presented.