463 research outputs found
Two combined methods for the global solution of implicit semilinear differential equations with the use of spectral projectors and Taylor expansions
Two combined numerical methods for solving semilinear differential-algebraic
equations (DAEs) are obtained and their convergence is proved. The comparative
analysis of these methods is carried out and conclusions about the
effectiveness of their application in various situations are made. In
comparison with other known methods, the obtained methods require weaker
restrictions for the nonlinear part of the DAE. Also, the obtained methods
enable to compute approximate solutions of the DAEs on any given time interval
and, therefore, enable to carry out the numerical analysis of global dynamics
of mathematical models described by the DAEs. The examples demonstrating the
capabilities of the developed methods are provided. To construct the methods we
use the spectral projectors, Taylor expansions and finite differences. Since
the used spectral projectors can be easily computed, to apply the methods it is
not necessary to carry out additional analytical transformations
H
This paper investigates the problem of H∞ filtering for class discrete-time Lipschitz nonlinear singular systems with measurement quantization. Assume that the system measurement output is quantized by a static, memoryless, and logarithmic quantizer before it is transmitted to the filter, while the quantizer errors can be treated as sector-bound uncertainties. The attention of this paper is focused on the design of a nonlinear quantized H∞ filter to mitigate quantization effects and ensure that the filtering error system is admissible (asymptotically stable, regular, and causal), while having a unique solution with a prescribed H∞ noise attenuation level. By introducing some slack variables and using the Lyapunov stability theory, some sufficient conditions for the existence of the nonlinear quantized H∞ filter are expressed in terms of linear matrix inequalities (LMIs). Finally, a numerical example is presented to demonstrate the effectiveness of the proposed quantized filter design method
Exponential stabilization of a class of stochastic system with Markovian jump parameters and mode-dependent mixed time-delays
Copyright [2010] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected].
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this technical note, the globally exponential stabilization problem is investigated for a general class of stochastic systems with both Markovian jumping parameters and mixed time-delays. The mixed mode-dependent time-delays consist of both discrete and distributed delays. We aim to design a memoryless state feedback controller such that the closed-loop system is stochastically exponentially stable in the mean square sense. First, by introducing a new Lyapunov-Krasovskii functional that accounts for the mode-dependent mixed delays, stochastic analysis is conducted in order to derive a criterion for the exponential stabilizability problem. Then, a variation of such a criterion is developed to facilitate the controller design by using the linear matrix inequality (LMI) approach. Finally, it is shown that the desired state feedback controller can be characterized explicitly in terms of the solution to a set of LMIs. Numerical simulation is carried out to demonstrate the effectiveness of the proposed methods.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the National 973 Program of China under Grant 2009CB320600, and the Alexander von Humboldt Foundation of Germany. Recommended by Associate Editor G. Chesi
Block-Structured Supermarket Models
Supermarket models are a class of parallel queueing networks with an adaptive
control scheme that play a key role in the study of resource management of,
such as, computer networks, manufacturing systems and transportation networks.
When the arrival processes are non-Poisson and the service times are
non-exponential, analysis of such a supermarket model is always limited,
interesting, and challenging.
This paper describes a supermarket model with non-Poisson inputs: Markovian
Arrival Processes (MAPs) and with non-exponential service times: Phase-type
(PH) distributions, and provides a generalized matrix-analytic method which is
first combined with the operator semigroup and the mean-field limit. When
discussing such a more general supermarket model, this paper makes some new
results and advances as follows: (1) Providing a detailed probability analysis
for setting up an infinite-dimensional system of differential vector equations
satisfied by the expected fraction vector, where "the invariance of environment
factors" is given as an important result. (2) Introducing the phase-type
structure to the operator semigroup and to the mean-field limit, and a
Lipschitz condition can be obtained by means of a unified matrix-differential
algorithm. (3) The matrix-analytic method is used to compute the fixed point
which leads to performance computation of this system. Finally, we use some
numerical examples to illustrate how the performance measures of this
supermarket model depend on the non-Poisson inputs and on the non-exponential
service times. Thus the results of this paper give new highlight on
understanding influence of non-Poisson inputs and of non-exponential service
times on performance measures of more general supermarket models.Comment: 65 pages; 7 figure
Spatial Fluid Limits for Stochastic Mobile Networks
We consider Markov models of large-scale networks where nodes are
characterized by their local behavior and by a mobility model over a
two-dimensional lattice. By assuming random walk, we prove convergence to a
system of partial differential equations (PDEs) whose size depends neither on
the lattice size nor on the population of nodes. This provides a macroscopic
view of the model which approximates discrete stochastic movements with
continuous deterministic diffusions. We illustrate the practical applicability
of this result by modeling a network of mobile nodes with on/off behavior
performing file transfers with connectivity to 802.11 access points. By means
of an empirical validation against discrete-event simulation we show high
quality of the PDE approximation even for low populations and coarse lattices.
In addition, we confirm the computational advantage in using the PDE limit over
a traditional ordinary differential equation limit where the lattice is modeled
discretely, yielding speed-ups of up to two orders of magnitude
- …