Characterizations of generalized Hermite and sieved ultraspherical polynomials

A new characterization of the generalized Hermite polyno-
mials and of the orthogonal polynomials with respect to the measure
is derived which is based on a ``reversing property" of the coefficients in the corresponding recurrence formulas and does not use the representation in terms of Laguerre and Jacobi polynomials. A similar characterization can be obtained for a generalization of the sieved ultraspherical polynomials of the first and second kind. These results are applied in order to determine the asymptotic limit distribution for the zeros when the degree and the parameters tend to infinity with the same order.

     

Generalized evaluation subgroups of product spaces relative to a factor

For any -complexes and , we show that . We use this fact to compute generalized evaluation subgroups of generalized tori relative to a sphere.

     

Carleson measure characterization of Bloch functions

We give several equivalences of Bloch functions and little Bloch functions. Using these results we obtain the generalized Carleson measure characterization of Bloch functions and the generalized vanishing Carleson measure characterization of little Bloch functions, that is,f B if and only if |D f(z)| ^p (1-|z|²)^p-1 dm(z) is a generalized Carleson measure;f B ₀ if and only if |D f(z)| ^p (1-|z|²)^p-1 dm(z) is a generalized vanishing Carleson measure, whereD f( > 0) is the fractional derivative of analytic functionf of order, m denotes the normalised Lebesgue measure.Supported partly by the Young Teacher Natural Science Foundation of Shandong Province.     

A modified steepest descent method with applications to maximizing likelihood functions

In maximizing a non-linear function G(), it is well known that the steepest descent method has a slow convergence rate. Here we propose a systematic procedure to obtain a 1–1 transformation on the variables , so that in the space of the transformed variables, the steepest descent method produces the solution faster. The final solution in the original space is obtained by taking the inverse transformation. We apply the procedure in maximizing the likelihood functions of some generalized distributions which are widely used in modeling count data. It was shown that for these distributions, the steepest descent method via transformations produced the solutions very fast. It is also observed that the proposed procedure can be used to expedite the convergence rate of the first derivative based algorithms, such as Polak-Ribiere, Fletcher and Reeves conjugate gradient methods as well.     

Convexifactors,generalized convexity and vector optimization

In this article we study a recently introduced notion of non-smooth analysis, namely convexifactors. We study some properties of the convexifactors and introduce two new chain rules. A new notion of non-smooth pseudoconvex function is introduced and its properties are studied in terms of convexifactors. We also present some optimality conditions for vector minimization in terms of convexifactors.     

Existence and regularity of solution to the generalized Tricomi equation with a singular initial datum at a point

In this paper, we study the existence and regularity of a solution to the initial datum problem of a semilinear generalized Tricomi equation in mixed-type domain. We suppose that an initial datum on the degenerate plane is smooth away from the origin, and has a conormal singularity at this point, then we show that in some mixed-type domain, the solution exists and is conormal with respect to the characteristic conic surface which is issued from the origin and has a cusp singularity.     

Impulsive generalized function synchronization of complex dynamical networks

This Letter investigates generalized function synchronization of continuous and discrete complex networks by impulsive control. By constructing the reasonable corresponding impulsively controlled response networks, some criteria and corollaries are derived for the generalized function synchronization between the impulsively controlled complex networks, continuous and discrete networks are both included. Furthermore, the generalized linear synchronization and nonlinear synchronization are respectively illustrated by several examples. All the numerical simulations demonstrate the correctness of the theoretical results.     

What is quasiconvex analysis?

We endeavour to answer the question of the title, or rather the question of how much one can extend convex analysis to a wider framework in which some convexity features remain. Subdifferential calculus and duality are the main directions we consider     

On the Pseudoconvexity of a Quadratic Fractional Function

In this paper we give a necessary and sufficient condition for the pseudoconvexity of a function f which is the ratio of a quadratic function over an affine function. The obtained results allow to suggest a simple algorithm to test the pseudoconvexity of f and also to characterize the pseudoconvexity of the sum of a linear and a linear fractional function.