Analysis of stochastic bifurcation and chaos in stochastic Duffing-van der Pol system via Chebyshev polynomial approximation

The Chebyshev polynomial approximation is applied to investigate the stochastic period-doubling bifurcation and chaos problems of a stochastic Duffing-van der Pol system with bounded random parameter of exponential probability density function subjected to a harmonic excitation. Firstly the stochastic system is reduced into its equivalent deterministic one, and then the responses of stochastic system can be obtained by numerical methods. Nonlinear dynamical behaviour related to stochastic period-doubling bifurcation and chaos in the stochastic system is explored. Numerical simulations show that similar to its counterpart in deterministic nonlinear system of stochastic period-doubling bifurcation and chaos may occur in the stochastic Duffing-van der Pol system even for weak intensity of random parameter. Simply increasing the intensity of the random parameter may result in the period-doubling bifurcation which is absent from the deterministic system.

Real scalar field scattering with polynomial approximation around Schwarzschild–de Sitter black-hole

As one of the fitting methods, the polynomial approximation is effective to process sophisticated problem. In this paper, we employ this approach to handle the scattering of scalar field around the Schwarzschild-de Sitter blackhole. The complicated relationship between tortoise coordinate and radial coordinate is replaced by the approximate polynomial. The Schroedinger-like equation, the real boundary conditions and the polynomial approximation construct a full Sturm Liouville type problem. Then this boundary value problem can be solved numerically for two limiting cases： the first one is the Nariai black-hole whose horizons are close to each other, the second one is the black-hole with the horizons widely separated. Compared with previous results （Brevik and Tian）, the field near the event horizon and cosmological horizon can have a better description.

ORTHOGONAL POLYNOMIALS AND DETERMINANT FORMULAS OF FUNCTION-VALUED PADE-TYPE APPROXIMATION USING FOR SOLUTION OF INTEGRAL EQUATIONS

To solve Fredholm integral equations of the second kind, a generalized linear functional is introduced and a new function-valued Padé-type approximation is defined. By means of the power series expansion of the solution, this method can construct an approximate solution to solve the given integral equation. On the basis of the orthogonal polynomials, two useful determinant expressions of the numerator polynomial and the denominator polynomial for Padé-type approximation are explicitly given.

THE BERNSTEIN TYPE INEQUALITY AND SIMULTANEOUS APPROXIMATION BY INTERPOLATION POLYNOMIALS IN COMPLEX DOMAIN

In this paper we investigate simultaneous approximation for arbitrary system of nodes on smooth domain in complex plane. Some results which are better than those of known theorems are obtained.

On Approximation by Reciprocals of Polynomials with Positive Coefficients

In order to study the approximation by reciprocals of polynomials with real coefficients, one always assumes that the approximated function has a fixed sign on the given interval. Sometimes, the approximated function is permitted to have finite sign changes, such as l（l ≥ 1） times. Zhou Songping has studied the case l=1 and l≥2 in L^p spaces in order of priority. In this paper, we studied the case l ≥2 in Orlicz spaces by using the function extend, modified Jackson kernel, Hardy-Littlewood maximal function, Cauchy-Schwarz inequality, and obtained the Jackson type estimation.

Approximation to Continuous Functions by a Kind of Interpolation Polynomials

In this paper, an interpolation polynomial operator F n(f; l,x) is constructed based on the zeros of a kind of Jacobi polynomials as the interpolation nodes. For any continuous function f(x)∈C b [-1,1] (0≤b≤l) F n(f; l,x) converges to f(x) uniformly, where l is an odd number.

APPROXIMATION BY GENERALIZED MKZ-OPERATORS IN POLYNOMIAL WEIGHTED SPACES

We prove some approximation properties of generalized Meyer-Konig and Zeller operators for differentiable functions in polynomial weighted spaces. The results extend some results proved in [1-3,7-16].

ON SIMULTANEOUS APPROXIMATION BY LAGRANGE INTERPOLATING POLYNOMIALS

This paper considers to replace △_m(x)=(1-x^2)~2(1/2)/n +1/n^2 in the following result for simultaneous Lagrange interpolating approximation with (1-x^2)~2(1/2)/n: Let f∈C_(-1.1)~0 and r=[(q+2)/2],then |f^(k)(x)-P_^(k)(f,x)|=O(1)△_(n)^(a-k)(x)ω(f^(a),△(x))(‖L_n-‖+‖L_n‖),0≤k≤q, where P_n( f ,x)is the Lagrange interpolating polynomial of degree n+ 2r-1 of f on the nodes X_n U Y_n(see the definition of the text), and thus give a problem raised in [XiZh] a complete answer.

A DEVELOPMENT ON APPROXIMATION BY MONOTONE SEQUENCES OF POLYNOMIALS

Recently people proved that every f∈C[0, 1] can be uniformly approximated by polynomial sequences {P_n}, {Q_n} such for any x∈[0,1] and n=1,2,…that Q_n(x)<Q_(n+1)(x)<f(x)<P_(n+1)(x)<P_n(x). For example, Xie and Zhou showed that one can construct such monotone polynomial sequences which do achieve the best uniform approximation rate for a continuous func- tion. Actually they obtained a result as ‖P_n(x)-Q_n(x)‖≤42E_n (f), (1) which essentially improved a conclusion in Gal and Szabados. The present paper, by optimal procedure, improves this inequality to ‖[P_n(x)-Q_n(x)‖≤(18+ε)E_n(f), where εis any positive real number.

SIMULTANEOUSE APPROXIMATION TO A DIFFERENTIABLE FUNCTION AND ITS DERIVATIVES BY LAGRANGE INTERPOLATING POLYNOMIALS

This paper establishes the following pointwise result for simultancous Lagrange imterpolating approxima- tion:,then |f^(k)(x)-P_n^(k)(f,x)|=O(1)△_n^(q-k)(x)ω where P_n(f,x)is the Lagrange interpolating potynomial of deereeon the nodes X_nUY_n(see the definition of the next).

THE ORTHOGONAL POLYNOMIALS AND THE PADE'APPROXIMATION

The diagonal Pade' approximates for exp(x). tanx and tanhx are obtained in asimple manner by using the property of Legendre polynomials that on [ -1, 1] Pn (x)is orthogonal to every polynomial of lower degree. Gauss's quadrature formula is used tofined the denomiators of some functions.

A Study of Weighted Polynomial Approximations with Several Variables (II)

In this paper we investigate weighted polynomial approximations with several variables. Our study relates to the approximation for by weighted polynomial. Then we will give some results relating to the Lagrange interpolation, the best approximation, the Markov-Bernstein inequality and the Nikolskii- type inequality.

The Best m-Term One-Sided Approximation of Besov Classes by the Trigonometric Polynomials

In this paper, we continue studying the so called best m-term one-sided approximation and Greedy-liked one-sided ap- proximation by the trigonometric polynomials. The asymptotic estimations of the best m-terms one-sided approximation by the trigonometric polynomials on some classes of Besov spaces in the metricLp(Td(1≤p≤∞ are given.

Asymptotic Approximations of Apostol-Tangent Polynomials in Terms of Hyperbolic Functions

The tangent polynomials Tn(z)are generalization of tangent numbers or the Euler zigzag numbers Tn.In particular,Tn(0)=Tn.These polynomials are closely related to Bernoulli,Euler and Genocchi polynomials.One of the extensions and analogues of special polynomials that attract the attention of several mathematicians is the Apostol-type polynomials.One of these Apostol-type polynomials is the Apostol-tangent polynomials Tn(z,λ).Whenλ=1,Tn(z,1)=Tn(z).The use of hyperbolic functions to derive asymptotic approximations of polynomials together with saddle point method was applied to the Bernoulli and Euler polynomials by Lopez and Temme.The same method was applied to the Genocchi polynomials by Corcino et al.The essential steps in applying the method are(1)to obtain the integral representation of the polynomials under study using their exponential generating functions and the Cauchy integral formula,and(2)to apply the saddle point method.It is found out that the method is applicable to Apostol-tangent polynomials.As a result,asymptotic approximation of Apostol-tangent polynomials in terms of hyperbolic functions are derived for large values of the parameter n and uniform approximation with enlarged region of validity are also obtained.Moreover,higher-order Apostol-tangent polynomials are introduced.Using the same method,asymptotic approximation of higherorder Apostol-tangent polynomials in terms of hyperbolic functions are derived and uniform approximation with enlarged region of validity are also obtained.It is important to note that the consideration of Apostol-type polynomials and higher order Apostol-type polynomials were not done by Lopez and Temme.This part is first done in this paper.The accuracy of the approximations are illustrated by plotting the graphs of the exact values of the Apostol-tangent and higher-order Apostol-tangent polynomials and their corresponding approximate values for specific values of the parameters n,λand m.

Orthogonal Polynomials and Padé Approximation

The diagonal Padé approximants for exp ( x ), tan x and tanh x are obtained in a simple manner by using the property of Legendre polynomials that on P r1 (x) is orthogonal to every polynomial of lower degree. Gauss's quadrature formula is used to find the denominators of some functions.

Pointwise Approximation Theorems for Combinations of Bernstein Polynomials with Inner Singularities

It is well-known that Bernstein polynomials are very important in studying the characters of smoothness in theory of approximation. A new type of combinations of Bernstein operators are given in [1]. In this paper, we give the Bernstein-Markov inequalities with step-weight functions for combinations of Bernstein polynomials with inner singularities as well as direct and inverse theorems.

Approximation of Finite Population Totals Using Lagrange Polynomial

Approximation of finite population totals in the presence of auxiliary information is considered. A polynomial based on Lagrange polynomial is proposed. Like the local polynomial regression, Horvitz Thompson and ratio estimators, this approximation technique is based on annual population total in order to fit in the best approximating polynomial within a given period of time (years) in this study. This proposed technique has shown to be unbiased under a linear polynomial. The use of real data indicated that the polynomial is efficient and can approximate properly even when the data is unevenly spaced.

APPROXIMATION PROPERTIES OF LAGRANGE INTERPOLATION POLYNOMIAL BASED ON THE ZEROS OF (1-x^2)cosnarccosx

We study some approximation properties of Lagrange interpolation polynomial based on the zeros of （1-x^2）cosnarccosx. By using a decomposition for f（x） ∈ C^τC^τ＋1 we obtain an estimate of ‖f（x） -Ln＋2（f, x）‖ which reflects the influence of the position of the x＇s and ω（f^（r＋1）,δ）j,j = 0, 1,... , s,on the error of approximation.

Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach

One of the open problems in the field of forward uncertainty quantification(UQ)is the ability to form accurate assessments of uncertainty having only incomplete information about the distribution of random inputs.Another challenge is to efficiently make use of limited training data for UQ predictions of complex engineering problems,particularly with high dimensional random parameters.We address these challenges by combining data-driven polynomial chaos expansions with a recently developed preconditioned sparse approximation approach for UQ problems.The first task in this two-step process is to employ the procedure developed in[1]to construct an"arbitrary"polynomial chaos expansion basis using a finite number of statistical moments of the random inputs.The second step is a novel procedure to effect sparse approximation via l1 minimization in order to quantify the forward uncertainty.To enhance the performance of the preconditioned l1 minimization problem,we sample from the so-called induced distribution,instead of using Monte Carlo(MC)sampling from the original,unknown probability measure.We demonstrate on test problems that induced sampling is a competitive and often better choice compared with sampling from asymptotically optimal measures(such as the equilibrium measure)when we have incomplete information about the distribution.We demonstrate the capacity of the proposed induced sampling algorithm via sparse representation with limited data on test functions,and on a Kirchoff plating bending problem with random Young’s modulus.

APPROXIMATION BY KANTOROVICH-BERNSTEIN POLYNOMIALS IN L_p(0

The purpose of the present paper is to evaluate the error of the approximation of the func- tion fL_1[0,1]by Kantorovich-Bernstein polynomials in L_p-metric(0<p<1).