Generalized polynomial chaos expansion by reanalysis using static condensation based on substructuring

This paper presents a new computational method for forward uncertainty quantification(UQ)analyses on large-scale structural systems in the presence of arbitrary and dependent random inputs.The method consists of a generalized polynomial chaos expansion(GPCE)for statistical moment and reliability analyses associated with the stochastic output and a static reanalysis method to generate the input-output data set.In the reanalysis,we employ substructuring for a structure to isolate its local regions that vary due to random inputs.This allows for avoiding repeated computations of invariant substructures while generating the input-output data set.Combining substructuring with static condensation further improves the computational efficiency of the reanalysis without losing accuracy.Consequently,the GPCE with the static reanalysis method can achieve significant computational saving,thus mitigating the curse of dimensionality to some degree for UQ under high-dimensional inputs.The numerical results obtained from a simple structure indicate that the proposed method for UQ produces accurate solutions more efficiently than the GPCE using full finite element analyses(FEAs).We also demonstrate the efficiency and scalability of the proposed method by executing UQ for a large-scale wing-box structure under ten-dimensional(all-dependent)random inputs.

SATURATION THEOREMS FOR GENERALIZED BERNSTEIN POLYNOMIALS

In the present paper, we give the explicit formula of the principal part of ∑k=0^n（{k}q-[n]qx）^sxk ∏m=0^n-k-1（1-q^mx） with respect to [n]q for any integer s and q ∈ （0, 1]. And, using the expressions, we obtain saturation theorems for Bn （f , qn,x） approximating to f（x） ∈ C[O, 1], 0 〈 qn ≤ 1, qn → 1.

Some Remarks for the Relationships between the Generalized Bernoulli and Euler Polynomials

In this paper,we prove the Srivastava-Pint'er's addition theorems(see Applied Mathematic Lett.17(2004),375-380) by applying the another methods.We also provide some analoges of these addition theorems and deduce the corresponding special cases.

Binary Bell Polynomials Approach to Generalized Nizhnik-Novikov-Veselov Equation

The elementary and systematic binary Bell polynomials method is applied to the generalized NizhnikNovikov-Veselov (GNNV) equation.The bilinear representation,bilinear B&cklund transformation,Lax pair and infiniteconservation laws of the GNNV equation are obtained directly,without too much trick like Hirota’s bilinear method.

GENERALIZED FRACTIONAL CALCULUS OF THE ALEPH-FUNCTION INVOLVING A GENERAL CLASS OF POLYNOMIALS

The object of this article is to study and develop the generalized fractional calcu- lus operators given by Saigo and Maeda in 1996. We establish generalized fractional calculus formulas involving the product of R-function, Appell function F3 and a general class of poly- nomials. The results obtained provide unification and extension of the results given by Saxena et al. [13], Srivastava and Grag [17], Srivastava et al. [20], and etc. The results are obtained in compact form and are useful in preparing some tables of operators of fractional calculus. On account of the general nature of the Saigo-Maeda operators, R-function, and a general class of polynomials a large number of new and known results involving Saigo fractional calculus operators and several special functions notably H-function, /-function, Mittag-Leffier function, generalized Wright hypergeometric function, generalized Bessel-Maitland function follow as special cases of our main findings.

An Investigation on Generalized Eulerian Polynomials and Fractions

This note establishes a pair of exponential generating functions for generalized Eulerian polynomials and Eulerian fractions, respectively. A kind of recurrence relation is obtained for the Eulerian fractions. Finally, a short proof of a certain summarion formula is given

GENERALIZED WEIGHTED SOBOLEV SPACES AND APPLICATIONS TO SOBOLEV ORTHOGONAL POLYNOMIALS Ⅱ

We present a definition of general Sobolev spaces with respect to arbitrary measures, Wk,p(Ω,μ) for 1 .≤p≤∞.In [RARP] we proved that these spaces are complete under very light conditions. Now we prove that if we consider certain general types of measures, then Cτ∞(R) is dense in these spaces. As an application to Sobolev orthogonal polynomials, toe study the boundedness of the multiplication operator. This gives an estimation of the zeroes of Sobolev orthogonal polynomials.

Some new generating function formulae of the two-variable Hermite polynomials and their application in quantum optics

We derive some new generating function formulae of the two-variable Hermite polynomials, such as ∞∑n=0tm/m!Hn,2m（x）,∞∑n=0sntm/n!m!H2n,2m（x,y）,and ∞∑n=0sntm/n!m!H2n＋l,2m＋k（x,y）.We employ the operator Hermite polynomial method and the technique of integration within an ordered product of operators to solve these problems, which will be useful in constructing new optical field states.

New generating function formulae of even- and odd-Hermite polynomials obtained and applied in the context of quantum optics

By combining the operator Hermite polynomial method and the technique of integration within an ordered product of operators, for the first time we derive the generating function of even- and odd-Hermite polynomials which will be useful in constructing new optical field states. We then show that the squeezed state and photon-added squeezed state can be expressed by even- and odd-Hermite polynomials.

Generating function of product of bivariate Hermite polynomials and their applications in studying quantum optical states

By virtue of the operator-Hermite-polynomial method, we derive some new generating function formulas of the product of two bivariate Hermite polynomials. Their applications in studying quantum optical states are presented.

On Degenerate Array Type Polynomials

In the paper,with the help of the Fa′a di Bruno formula and an identity of the Bell polynomials of the second kind,the authors define degenerateλ-array type polynomials,establish two explicit formulas,and present several recurrence relations of degenerateλ-array type polynomials and numbers.

INTERPOLATION WITH LAGRANGE POLYNOMIALS A SIMPLE PROOF OF MARKOV INEQUALITY AND SOME OF ITS GENERALIZATIONS

The following theorem is proved Theorem 1.Let q be a polynomial of degree n(qP_n)with n distinct zeroes lying in the interval[-1,1] and △'_q={-1}∪{τ_i:q'(τ_i)=0,i=1,n-1}∪{1}. If polynomial pP_n satisfies the inequality then for each k=1,n and any x[-1,1]its k-th derivative satisfies the inequality 丨p^(k)(x)丨≤max{丨q^((k))(x)丨,丨1/k(x^2-1)q^(k+1)(x)+xq^((k))(x)丨}. This estimate leads to the Markov inequality for the higher order derivatives of polynomials if we set q=T_n,where Tn is Chebyshev polynomial least deviated from zero. Some other results are established which gives evidence to the conjecture that under the conditions of Theorem 1 the inequality ‖p^((k))‖≤‖q^(k)‖holds.

Lucas Symbolic Formulae and Generating Functions for Chebyshev Polynomials

This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functions of them by operator calculus built from the derivative and the positional operators.

高阶Apostol-Euler多项式的一些性质

利用拟单项和算子方法从算子的角度研究高阶Apostol-Euler多项式满足的递推关系和微分方程等性质,由其中一些主要结论可以推导出Euler多项式和高阶Euler多项式相应的性质,丰富并推广了已有的结论.此外,还利用与Hermite多项式相关的指数算子推广了高阶Apostol-Euler多项式,并研究其满足的微分方程和一些关系等式.

几个广义Apostol-Bernoulli、Apostol-Euler多项式之间的关系式

利用发生函数理论结合某些运算技巧,推出了几个广义Apostol-Bernoulli多项式、广义Apostol-Euler多项式之间的关系式.多个参数出现在等式中,非常工整.在关系式中选取适当的参数,就可以得到已有的著名的关于广义Bernoulli多项式、广义Euler多项式之间的关系式,从而深化和推广了对Bernoulli数、Euler数、Bernoulli多项式、Euler多项式的相关研究结果.

Robust power amplifier predistorter by using memory polynomials

In memory polynomial predistorter design, the coefficient estimation algorithm based on normalized least mean square is sensitive to initialization parameters. A predistorter based on generalized normalized gradient descent algorithm is proposed. The merit of the GNGD algorithm is that its learning rate provides compensation for the independent assumptions in the derivation of NLMS, thus its stability is improved. Computer simulation shows that the proposed predistorter is very robust. It can overcome the sensitivity of initialization parameters and get a better linearization performance.

ON THE COEFFICIENTS OF DIFFERENTIATED EXPANSIONS AND DERIVATIVES OF CHEBYSHEV POLYNOMIALS OF THE THIRD AND FOURTH KINDS

Two new analytical formulae expressing explicitly the derivatives of Chebyshev polynomials of the third and fourth kinds of any degree and of any order in terms of Chebyshev polynomials of the third and fourth kinds themselves are proved. Two other explicit formulae which express the third and fourth kinds Chebyshev expansion coefficients of a general-order derivative of an infinitely differentiable function in terms of their original expansion coefficients are also given. Two new reduction formulae for summing some terminating hypergeometric functions of unit argument are deduced. As an application of how to use Chebyshev polynomials of the third and fourth kinds for solving high-order boundary value problems, two spectral Galerkin numerical solutions of a special linear twelfth-order boundary value problem are given.

RIEMANN-HILBERT CHARACTERIZATION FOR MAIN BESSEL POLYNOMIALS WITH VARYING LARGE NEGATIVE PARAMETERS

In this article, we establish the Bessel polynomials with varying large negative parameters and discuss their orthogonality based on the generalized Bessel polynomials. By using the Riemann-Hilbert boundary value problem on the positive real axis, we get the Riemann-Hilbert characterization of the main Bessel polynomials with varying large negative parameters.

APPROXIMATION OF GENERALIZED BI－AXIALLY SYMMETRIC POTENTIALS WITH FAST RATES OF GROWTH

The paper deals with growth and approximation of solutions (not necessarily entire) of certain elliptic partial differential equations. These solutions are called Generalized Bi-axially Symmetric Potentials (GBSP's). The GBSP's are taken to be regular in a finite hyperball and influence of the growth of their maximum moduli on the rate of decay of their approximation errors in sup norm is studied. The authors obtain the characterizations of the q-type and lower q-type of a GBSP H ∈ HP,0 < R < ∞, in terms of rate of decay of approximation error E.(H,R0), 0 < R0<R <∞.

Linear complexity of Ding generalized cyclotomic sequences

Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Zpq are obtained by Bai in 2005. In this paper, we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences. Our result shows that linear complexity of these sequences takes on the values pq and pq-1 on our necessary and sufficient condition with probability 1/4 and the lower bound （pq - 1）/2 with probability 1/8. This shows that most of these sequences are good. We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders. This makes it no more difficult in choosing proper p and q.