The task of robust fault detection and diagnosis of stochastic distribution control (SDC) systems with uncertainties is to use the measured input and the system output PDFs to still obtain possible faults informatio...The task of robust fault detection and diagnosis of stochastic distribution control (SDC) systems with uncertainties is to use the measured input and the system output PDFs to still obtain possible faults information of the system. Using the rational square-root B-spline model to represent the dynamics between the output PDF and the input, in this paper, a robust nonlinear adaptive observer-based fault diagnosis algorithm is presented to diagnose the fault in the dynamic part of such systems with model uncertainties. When certain conditions are satisfied, the weight vector of the rational square-root B-spline model proves to be bounded. Conver- gency analysis is performed for the error dynamic system raised from robust fault detection and fault diagnosis phase. Computer simulations are given to demon- strate the effectiveness of the proposed algorithm.展开更多
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 se...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.展开更多
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 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.展开更多
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 th...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.展开更多
Based on a node group <img src="Edit_effba4ca-e855-418a-8a72-d70cb1ec3470.png" width="240" height="46" alt="" />, the Newman type rational operator is constructed in the p...Based on a node group <img src="Edit_effba4ca-e855-418a-8a72-d70cb1ec3470.png" width="240" height="46" alt="" />, 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 <img src="Edit_174e8f70-651b-4abb-a8f3-a16a576536dc.png" width="85" height="50" alt="" /> regarding to <em>X</em>. Moreover, if the operator is constructed based on further subdivision nodes, the convergence rate is <img src="Edit_557b3a01-7f56-41c0-bb67-deab88b9cc63.png" width="85" height="45" alt="" />. 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.展开更多
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 Ja...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 δ.展开更多
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.
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 rest...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.展开更多
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 ...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.展开更多
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 par...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.展开更多
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 ...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 <em>f</em>(<em>t</em>) 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.展开更多
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-Fabc...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).展开更多
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 converg...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.展开更多
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 cer...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.展开更多
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 pert...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.展开更多
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 th...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.展开更多
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 ...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)展开更多
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 algorith...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.展开更多
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 proble...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.展开更多
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...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 α.展开更多
基金Supported by the National Natural Science Foundation of China (Grant No. 60534010)the Outstanding Overseas Chinese Scholars Fund of CAS (Grant No. 2004-1-4)
文摘The task of robust fault detection and diagnosis of stochastic distribution control (SDC) systems with uncertainties is to use the measured input and the system output PDFs to still obtain possible faults information of the system. Using the rational square-root B-spline model to represent the dynamics between the output PDF and the input, in this paper, a robust nonlinear adaptive observer-based fault diagnosis algorithm is presented to diagnose the fault in the dynamic part of such systems with model uncertainties. When certain conditions are satisfied, the weight vector of the rational square-root B-spline model proves to be bounded. Conver- gency analysis is performed for the error dynamic system raised from robust fault detection and fault diagnosis phase. Computer simulations are given to demon- strate the effectiveness of the proposed algorithm.
文摘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.
基金Project supported by the National Basic Research Program (973) of China (No. 2002CB312101) and the National Natural Science Foun-dation of China (Nos. 60373033 and 60333010)
文摘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.
基金supported by the National Science Foundation of China(No.11161033)Inner Mongolia Normal University Talent Project Foundation(No.RCPY-2-2012-K-036)
文摘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.
文摘Based on a node group <img src="Edit_effba4ca-e855-418a-8a72-d70cb1ec3470.png" width="240" height="46" alt="" />, 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 <img src="Edit_174e8f70-651b-4abb-a8f3-a16a576536dc.png" width="85" height="50" alt="" /> regarding to <em>X</em>. Moreover, if the operator is constructed based on further subdivision nodes, the convergence rate is <img src="Edit_557b3a01-7f56-41c0-bb67-deab88b9cc63.png" width="85" height="45" alt="" />. 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.
基金supported by the National Natural Science Foundation of China (10901044)Research Project of Hangzhou Normal University (YS05203154)
文摘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 δ.
基金Supported by the National Natural Science Foundation of China(11161033)Inner Mongolia Natural Science Foundation (2009MS0105)
文摘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.
基金Project supported by Inner Mongolia University of Science and Technology (No.X200829)
文摘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.
基金This research is suported by National Science foundation Grant.
文摘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.
基金Supported by the National Natural Science Foundation of China(61573378)the Fundamental Research Funds for the Central Universities(15CX06064A)
文摘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.
文摘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 <em>f</em>(<em>t</em>) 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.
文摘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).
基金The work is supported by Project 69 with Ministry of ScienceEducation, Bulgaria.
文摘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.
文摘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.
基金Supported by the Foundation of Inner Mongolia University of Technology(X200829)~~
文摘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.
基金supported by the National Natural Science Foundation of China (10872030)
文摘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.
基金Supported by the National Nature Science Foundation.
文摘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)
基金The work of this author is supported by The Foundation of CAEP 20030658)The work of this author is partially supported by The Shanghai Natural Science Foundation N.00JC14057+1 种基金The Shanghai Natural Science Foundation for Youth N. 01QN85.The work of thi
文摘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.
基金Supported by Universidad Nacional de Rfo Cuaito and CONICET.
文摘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.
文摘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 α.