On stationary Markov processes with polynomial conditional moments

We study a class of stationary Markov processes with marginal distributions identifiable by moments such that every conditional moment of degree say m is a polynomial of degree at most m. We show that then under some additional, natural technical assumption there exists a family of orthogonal polynomial martingales. More precisely we show that such a family of processes is completely characterized by the sequence {(α_n, p_n)}_{n ? 0} where α′_ns are some positive reals while p′_ns are some monic orthogonal polynomials. Bakry and Mazet (Séminaire de Probabilit?s, vol. 37, 2003) showed that under some additional mild technical conditions each such sequence generates some stationary Markov process with polynomial regression.

We single out two important subclasses of the considered class of Markov processes. The class of harnesses that we characterize completely. The second one constitutes of the processes that have independent regression property and are stationary. Processes with independent regression property so to say generalize ordinary Ornstein–Uhlenbeck (OU) processes or can also be understood as time scale transformations of Lévy processes. We list several properties of these processes. In particular we show that if these process are time scale transforms of Lévy processes then they are not stationary unless we deal with classical OU process. Conversely, time scale transformations of stationary processes with independent regression property are not Lévy unless we deal with classical OU process.     

Some remarks on Bridgeland’s Hall algebras

We study the functorial properties of Bridgeland’s Hall algebras. Specifically, let 𝒜 and ? be two categories satisfying certain conditions for the definitions of Bridgeland’s Hall algebras, and let F:𝒜→? be a fully faithful exact functor, which preserves projectives, then F induces an embedding of algebras from the Bridgeland’s Hall algebra of 𝒜 to the one of ?. In addition, let A be a finite-dimensional algebra over a finite field and B some special quotient algebra of A, then the Bridgeland’s Hall algebra of B is the quotient algebra of the one of A. Moreover, we consider the BGP-reflection functors on the category of 2-cyclic complexes and obtain some homomorphisms of algebras among the subalgebras of Bridgeland’s Hall algebras.     

Eléments finis stochastiques en élasticité linéaireA stochastic finite element method in linear mechanics

The stochastic finite element method presented in this Note consists in representing in a probabilistic form the response of a linear mechanical system whose material properties and loading are random. Each input random variable is expanded into a Hermite polynomial series in standard normal random variables. The response (e.g., the nodal displacement vector) is expanded onto the so-called polynomial chaos. The coefficients of the expansion are obtained by a Galerkin-type method in the space of probability. To cite this article: B. Sudret et al., C. R. Mecanique 332 (2004).     

Critical periods of perturbations of reversible rigidly isochronous centers

In this paper we discuss bifurcation of critical periods in an m-th degree time-reversible system, which is a perturbation of an n-th degree homogeneous vector field with a rigidly isochronous center at the origin. We present period-bifurcation functions as integrals of analytic functions which depend on perturbation coefficients and reduce the problem of critical periods to finding zeros of a judging function. This procedure gives not only the number of critical periods bifurcating from the period annulus but also the location of these critical periods. Applying our procedure to the case n=m=2 we determine the maximum number of critical periods and their location; to the case n=m=3 we investigate the bifurcation of critical periods up to the first order in ε and obtain the expression of the second period-bifurcation function when the first one vanishes.     

Effective partitioning method for computing generalized inverses and their gradients

We extend the algorithm for computing {1}, {1, 3}, {1, 4} inverses and their gradients from [11] to the set of multiple-variable rational and polynomial matrices. An improvement of this extension, appropriate to sparse polynomial matrices with relatively small number of nonzero coefficient matrices as well as in the case when the nonzero coefficient matrices are sparse, is introduced. For that purpose, we exploit two effective structures form [6], which make use of only nonzero addends in polynomial matrices, and define their partial derivatives. Symbolic computational package MATHEMATICA is used in the implementation. Several randomly generated test matrices are tested and the CPU times required by two used effective structures are compared and discussed.     

Explicit solution of the finite time L2-norm polynomial approximation problem

The aim of this paper is to present a new approach to the finite time L₂-norm polynomial approximation problem. A new formulation of this problem leads to an equivalent linear system whose solution can be investigated analytically. Such a solution is then specialized for a polynomial expressed in terms of Laguerre and Bernstein basis.     

Asymptotic properties of fractional delay differential equations

In this paper we study the asymptotic properties of d-dimensional linear fractional differential equations with time delay. We present necessary and sufficient conditions for asymptotic stability of equations of this type using the inverse Laplace transform method and prove polynomial decay of stable solutions. Two examples illustrate the obtained analytical results.     

Regenerative cascade homotopies for solving polynomial systems

A key step in the numerical computation of the irreducible decomposition of a polynomial system is the computation of a witness superset of the solution set. In many problems involving a solution set of a polynomial system, the witness superset contains all the needed information. Sommese and Wampler gave the first numerical method to compute witness supersets, based on dimension-by-dimension slicing of the solution set by generic linear spaces, followed later by the cascade homotopy of Sommese and Verschelde. Recently, the authors of this article introduced a new method, regeneration, to compute solution sets of polynomial systems. Tests showed that combining regeneration with the dimension-by-dimension algorithm was significantly faster than naively combining it with the cascade homotopy. However, in this article, we combine an appropriate randomization of the polynomial system with the regeneration technique to construct a new cascade of homotopies for computing witness supersets. Computational tests give strong evidence that regenerative cascade is superior in practice to previous methods.