Large time behaviour for functional differential equations with dominant eigenvalues of arbitrary order

The spectral theory for linear autonomous neutral functional differential equations (FDE) yields explicit formulas for the large time behaviour of solutions. Our results are based on resolvent computations and Dunford calculus, applied to establish explicit formulas for the large time behaviour of solutions of FDE. We investigate in detail a class of two-dimensional systems of FDE. (C) 2009 Elsevier Inc. All rights reserved.

On the dominance of roots of characteristic equations for neutral functional differential equations

We present a sufficient condition for a zero of a function that arises typically as the characteristic equation of a linear functional differential equations of neutral type, to be simple and dominant. This knowledge is useful in order to derive the asymptotic behaviour of solutions of such equations. A simple characteristic equation, arisen from the study of delay equations with small delay, is analyzed in greater detail. (C) 2009 Elsevier Inc. All rights reserved.

Invariants of binary differential equations

In this paper, we study binary differential equations a(x, y)dy (2) + 2b(x, y) dx dy + c(x, y)dx (2) = 0, where a, b, and c are real analytic functions. Following the geometric approach of Bruce and Tari in their work on multiplicity of implicit differential equations, we introduce a definition of the index for this class of equations that coincides with the classical Hopf`s definition for positive binary differential equations. Our results also apply to implicit differential equations F(x, y, p) = 0, where F is an analytic function, p = dy/dx, F (p) = 0, and F (pp) not equal aEuro parts per thousand 0 at the singular point. For these equations, we relate the index of the equation at the singular point with the index of the gradient of F and index of the 1-form omega = dy -aEuro parts per thousand pdx defined on the singular surface F = 0.

Combining Legendre's Polynomials and Genetic Algorithm in the Solution of Nonlinear Initial-Value Problems

This work develops a method for solving ordinary differential equations, that is, initial-value problems, with solutions approximated by using Legendre's polynomials. An iterative procedure for the adjustment of the polynomial coefficients is developed, based on the genetic algorithm. This procedure is applied to several examples providing comparisons between its results and the best polynomial fitting when numerical solutions by the traditional Runge-Kutta or Adams methods are available. The resulting algorithm provides reliable solutions even if the numerical solutions are not available, that is, when the mass matrix is singular or the equation produces unstable running processes.

Self-organized distribution of periodicity and chaos in an electrochemical oscillator

We report a detailed numerical investigation of a prototype electrochemical oscillator, in terms of high-resolution phase diagrams for an experimentally relevant section of the control (parameter) space. The prototype model consists of a set of three autonomous ordinary differential equations which captures the general features of electrochemical oscillators characterized by a partially hidden negative differential resistance in an N-shaped current-voltage stationary curve. By computing Lyapunov exponents, we provide a detailed discrimination between chaotic and periodic phases of the electrochemical oscillator. Such phases reveal the existence of an intricate structure of domains of periodicity self-organized into a chaotic background. Shrimp-like periodic regions previously observed in other discrete and continuous systems were also observed here, which corroborate the universal nature of the occurrence of such structures. In addition, we have also found a structured period distribution within the order region. Finally we discuss the possible experimental realization of comparable phase diagrams.

Who should wear mask against airborne infections? Altering the contact network for controlling the spread of contagious diseases

There are several ways of controlling the propagation of a contagious disease. For instance, to reduce the spreading of an airborne infection, individuals can be encouraged to remain in their homes and/or to wear face masks outside their domiciles. However, when a limited amount of masks is available, who should use them: the susceptible subjects, the infective persons or both populations? Here we employ susceptible-infective-recovered (SIR) models described in terms of ordinary differential equations and probabilistic cellular automata in order to investigate how the deletion of links in the random complex network representing the social contacts among individuals affects the dynamics of a contagious disease. The inspiration for this study comes from recent discussions about the impact of measures usually recommended by health public organizations for preventing the propagation of the swine influenza A (H1N1) virus. Our answer to this question can be valid for other eco-epidemiological systems. (C) 2010 Elsevier BM. All rights reserved.

On the basic reproduction number and the topological properties of the contact network: An epidemiological study in mainly locally connected cellular automata

We study the spreading of contagious diseases in a population of constant size using susceptible-infective-recovered (SIR) models described in terms of ordinary differential equations (ODEs) and probabilistic cellular automata (PCA). In the PCA model, each individual (represented by a cell in the lattice) is mainly locally connected to others. We investigate how the topological properties of the random network representing contacts among individuals influence the transient behavior and the permanent regime of the epidemiological system described by ODE and PCA. Our main conclusions are: (1) the basic reproduction number (commonly called R(0)) related to a disease propagation in a population cannot be uniquely determined from some features of transient behavior of the infective group; (2) R(0) cannot be associated to a unique combination of clustering coefficient and average shortest path length characterizing the contact network. We discuss how these results can embarrass the specification of control strategies for combating disease propagations. (C) 2009 Elsevier B.V. All rights reserved.

The Diffusion Kernel Filter

A particle filter method is presented for the discrete-time filtering problem with nonlinear ItA ` stochastic ordinary differential equations (SODE) with additive noise supposed to be analytically integrable as a function of the underlying vector-Wiener process and time. The Diffusion Kernel Filter is arrived at by a parametrization of small noise-driven state fluctuations within branches of prediction and a local use of this parametrization in the Bootstrap Filter. The method applies for small noise and short prediction steps. With explicit numerical integrators, the operations count in the Diffusion Kernel Filter is shown to be smaller than in the Bootstrap Filter whenever the initial state for the prediction step has sufficiently few moments. The established parametrization is a dual-formula for the analysis of sensitivity to gaussian-initial perturbations and the analysis of sensitivity to noise-perturbations, in deterministic models, showing in particular how the stability of a deterministic dynamics is modeled by noise on short times and how the diffusion matrix of an SODE should be modeled (i.e. defined) for a gaussian-initial deterministic problem to be cast into an SODE problem. From it, a novel definition of prediction may be proposed that coincides with the deterministic path within the branch of prediction whose information entropy at the end of the prediction step is closest to the average information entropy over all branches. Tests are made with the Lorenz-63 equations, showing good results both for the filter and the definition of prediction.

Generalized Coupled Algebraic Riccati Equations for Discrete-time Markov Jump with Multiplicative Noise Systems

In this paper we consider the existence of the maximal and mean square stabilizing solutions for a set of generalized coupled algebraic Riccati equations (GCARE for short) associated to the infinite-horizon stochastic optimal control problem of discrete-time Markov jump with multiplicative noise linear systems. The weighting matrices of the state and control for the quadratic part are allowed to be indefinite. We present a sufficient condition, based only on some positive semi-definite and kernel restrictions on some matrices, under which there exists the maximal solution and a necessary and sufficient condition under which there exists the mean square stabilizing solution fir the GCARE. We also present a solution for the discounted and long run average cost problems when the performance criterion is assumed be composed by a linear combination of an indefinite quadratic part and a linear part in the state and control variables. The paper is concluded with a numerical example for pension fund with regime switching.

Existence Results for Abstract Partial Neutral Integro-differential Equation with Unbounded Delay

In this paper we study the existence and regularity of mild solutions for a class of abstract partial neutral integro-differential equations with unbounded delay.

Theory of small-signal ac response of a dielectric liquid containing two groups of ions

The analysis of Macdonald for electrolytes is generalized to the case in which two groups of ions are present. We assume that the electrolyte can be considered as a dispersion of ions in a dielectric liquid, and that the ionic recombination can be neglected. We present the differential equations governing the ionic redistribution when the liquid is subjected to an external electric field, describing the simultaneous diffusion of the two groups of ions in the presence of their own space charge fields. We investigate the influence of the ions on the impedance spectroscopy of an electrolytic cell. In the analysis, we assume that each group of ions have equal mobility, the electrodes perfectly block and that the adsorption phenomena can be neglected. In this framework, it is shown that the real part of the electrical impedance of the cell has a frequency dependence presenting two plateaux, related to a type of ambipolar and free diffusion coefficients. The importance of the considered problem on the ionic characterization performed by means of the impedance spectroscopy technique was discussed. (c) 2008 American Institute of Physics.

Inference of gene regulatory networks from time series by Tsallis entropy

Background: The inference of gene regulatory networks (GRNs) from large-scale expression profiles is one of the most challenging problems of Systems Biology nowadays. Many techniques and models have been proposed for this task. However, it is not generally possible to recover the original topology with great accuracy, mainly due to the short time series data in face of the high complexity of the networks and the intrinsic noise of the expression measurements. In order to improve the accuracy of GRNs inference methods based on entropy (mutual information), a new criterion function is here proposed. Results: In this paper we introduce the use of generalized entropy proposed by Tsallis, for the inference of GRNs from time series expression profiles. The inference process is based on a feature selection approach and the conditional entropy is applied as criterion function. In order to assess the proposed methodology, the algorithm is applied to recover the network topology from temporal expressions generated by an artificial gene network (AGN) model as well as from the DREAM challenge. The adopted AGN is based on theoretical models of complex networks and its gene transference function is obtained from random drawing on the set of possible Boolean functions, thus creating its dynamics. On the other hand, DREAM time series data presents variation of network size and its topologies are based on real networks. The dynamics are generated by continuous differential equations with noise and perturbation. By adopting both data sources, it is possible to estimate the average quality of the inference with respect to different network topologies, transfer functions and network sizes. Conclusions: A remarkable improvement of accuracy was observed in the experimental results by reducing the number of false connections in the inferred topology by the non-Shannon entropy. The obtained best free parameter of the Tsallis entropy was on average in the range 2.5 <= q <= 3.5 (hence, subextensive entropy), which opens new perspectives for GRNs inference methods based on information theory and for investigation of the nonextensivity of such networks. The inference algorithm and criterion function proposed here were implemented and included in the DimReduction software, which is freely available at http://sourceforge.net/projects/dimreduction and http://code.google.com/p/dimreduction/.

A hybrid-mixed finite element formulation for the geometrically exact analysis of three-dimensional framed structures

This paper addresses the development of a hybrid-mixed finite element formulation for the quasi-static geometrically exact analysis of three-dimensional framed structures with linear elastic behavior. The formulation is based on a modified principle of stationary total complementary energy, involving, as independent variables, the generalized vectors of stress-resultants and displacements and, in addition, a set of Lagrange multipliers defined on the element boundaries. The finite element discretization scheme adopted within the framework of the proposed formulation leads to numerical solutions that strongly satisfy the equilibrium differential equations in the elements, as well as the equilibrium boundary conditions. This formulation consists, therefore, in a true equilibrium formulation for large displacements and rotations in space. Furthermore, this formulation is objective, as it ensures invariance of the strain measures under superposed rigid body rotations, and is not affected by the so-called shear-locking phenomenon. Also, the proposed formulation produces numerical solutions which are independent of the path of deformation. To validate and assess the accuracy of the proposed formulation, some benchmark problems are analyzed and their solutions compared with those obtained using the standard two-node displacement/ rotation-based formulation.

EXISTENCE OF S-ASYMPTOTICALLY omega-PERIODIC SOLUTIONS FOR ABSTRACT NEUTRAL EQUATIONS

A bounded continuous function it u : [0, infinity) -> X is said to be S-asymptotically omega-periodic if lim(t ->infinity)[u(t + omega) - u(t)] = 0. This paper is devoted to study the existence and qualitative properties of S-asymptotically omega-periodic mild solutions for some classes of abstract neutral functional differential equations with infinite delay, Furthermore, applications to partial differential equations are given.

MULTIPLICITY OF POSITIVE SOLUTIONS FOR A CLASS OF NONLINEAR SCHRODINGER EQUATIONS

This paper proves the multiplicity of positive solutions for the following class of quasilinear problems: {-epsilon(p)Delta(p)u+(lambda A(x) + 1)vertical bar u vertical bar(p-2)u = f(u), R(N) u(x)>0 in R(N), where Delta(p) is the p-Laplacian operator, N > p >= 2, lambda and epsilon are positive parameters, A is a nonnegative continuous function and f is a continuous function with subcritical growth. Here, we use variational methods to get multiplicity of positive solutions involving the Lusternick-Schnirelman category of intA(-1)(0) for all sufficiently large lambda and small epsilon.