DEGREE OF APPROXIMATION ASSOCIATED WITH SOME ELLIPTIC OPERATORS AND ITS APPLICATIONS

The Jackson-type estimates by using some elliptic operators will be achieved. These results will be used to characterize the regularity of some elliptic operators by means of the approximation degree and the saturation class of the multivariate Bernstein operators as well.

DEGREE OF APPROXIMATION BY SUPERPOSITIONS OF A SIGMOIDAL FUNCTION

In this paper we study the degree of approximation by superpositions of a sigmoidal function.We mainly consider the univariate case.If f is a continuous function,we prove that for any bounded sigmoidal function σ,d_(n,σ)(f)≤‖σ‖ω(f,1/(n+1)).For the Heaviside function H(x),we prove that d_(n,H)(f)≤ω(f,1/(2(n+1))). If f is a continuous funnction of bounded variation,we prove that d_(n,σ)(f)≤‖σ‖/(n+1)V(f)and d_(n,H)(f)≤ 1/(2(n+1))V(f).For he Heaviside function,the coefficient 1 and the approximation orders are the best possible.We compare these results with the classical Jackson and Bernstein theorems,and make some conjec- tures for further study.

A SHARP ESTIMATE ON THE DEGREE OF APPROXIMATION TO FUNCTIONS OF BOUNDED VARIATION BY CERTAIN OPERATORS

Recently Guo introduced integrated Meyer -Konig and Zeller operators and studied the rate of convergence for function of bounded variation. In this note we give a sharp estimate for these operators.

ON THE EXACT DEGREE OF APPROXIMATION BY HERMITE-FEJER INTERPOLATION BASED ON THE LAGUERRE ABSCISSAS

For the nonpositive Hermite-Fejér interpolation based on the Laguerre abscissas, a pointwise two-sided estimate of the degree of approximation in the aleatoric interval [0, A] is first established.

ON THE DEGREE OF APPROXIMATION BY WAVELET EXPANSIONS

In this paper we estimate the degree of approximation of wavelet expansions. Our result shows that the degree has the exponential decay for function f(x)∈L2 continuous in a finite interval (a, b) which is much superior to those of approximation by polynomial operators and by expansions of classical orthogonal series.

ASYMPTOTIC APPROXIMATION OF FUNCTIONS AND THEIR DERIVATIVES BY GENERALIZED BASKAKOV-SZAZS-DURRMEYER OPERATORS

We present the complete asymptotic expansion for a generalization of the Baskakov-Szasz-Durrmeyer operators and their derivatives.

ON STRONG APPROXIMATION APPLIED TO POST-WIDDER OPERATORS

We introduce modified Post-Widder operators in polynomial weighted spaces of differentiable functions and we study strong approximation for them.

ON THE SATURATION OF L_w^p-APPROXIMATION BY (O-q'-q) TYPE HERMITE-FEJER INTERPOLATING POLYNOMIALS

The 'o' saturation theorem and the degree of Lwp, approximation by (0 - q' - q) type Hermite-Fejer interpolating polynomials for mean convergence are obtained.

Application of Short-wave Near-infrared Reflectance Spectroscopy in Controlling Extract of Fructus Cnidii Using Supercritical Carbon Dioxide

Fructus cnidii （Chinese name shechuangzi） is the fruit produced by Cnidium monnieri （L.） Cusson （Umbelliferae）. It is a perennial herb that is used to treat skin-related diseases and gynecopathyell. Recent pharmacological studies have revealed crude extracts or components isolated from fructus cnidii possess antiallergic, antipruritic, antidermatophytic, antibacterial, antifungal, and antiosteoporotic activities. Osthole and imperatorin are the major compounds present in shechuangzi. They are often used as standards for the evaluation of the quality of shechuangzi products.

Improved Approximate Minimum Degree Ordering Method and Its Application for Electrical Power Network Analysis and Computation

Electrical power network analysis and computation play an important role in the planning and operation of the power grid,and they are modeled mathematically as differential equations and network algebraic equations.The direct method based on Gaussian elimination theory can obtain analytical results.Two factors affect computing efficiency:the number of nonzero element fillings and the length of elimination tree.This article constructs mapping correspondence between eliminated tree nodes and quotient graph nodes through graph and quotient graph theories.The Approximate Minimum Degree(AMD)of quotient graph nodes and the length of the elimination tree nodes are composed to build an Approximate Minimum Degree and Minimum Length(AMDML)model.The quotient graph node with the minimum degree,which is also the minimum length of elimination tree node,is selected as the next ordering vector.Compared with AMD ordering method and other common methods,the proposed method further reduces the length of elimination tree without increasing the number of nonzero fillings;the length was decreased by about 10%compared with the AMD method.A testbed for experiment was built.The efficiency of the proposed method was evaluated based on different sizes of coefficient matrices of power flow cases.

On Bounded Variation Functions by General MKZD Operators

In this paper, we study the rate of convergence for functions of bounded variation for the recently introduced Bzier variant of the Meyer-Knig-Zeller-Durrmeyer operators.