20,934 research outputs found
Lyapunov Criterion for Stochastic Systems and Its Applications in Distributed Computation
This paper presents new sufficient conditions for convergence and asymptotic
or exponential stability of a stochastic discrete-time system, under which the
constructed Lyapunov function always decreases in expectation along the
system's solutions after a finite number of steps, but without necessarily
strict decrease at every step, in contrast to the classical stochastic Lyapunov
theory. As the first application of this new Lyapunov criterion, we look at the
product of any random sequence of stochastic matrices, including those with
zero diagonal entries, and obtain sufficient conditions to ensure the product
almost surely converges to a matrix with identical rows; we also show that the
rate of convergence can be exponential under additional conditions. As the
second application, we study a distributed network algorithm for solving linear
algebraic equations. We relax existing conditions on the network structures,
while still guaranteeing the equations are solved asymptotically.Comment: 14 pages, 1 figur
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
B{\'e}zout 's theorem states that dense generic systems of n multivariate
quadratic equations in n variables have 2 n solutions over algebraically closed
fields. When only a small subset M of monomials appear in the equations
(fewnomial systems), the number of solutions may decrease dramatically. We
focus in this work on subsets of quadratic monomials M such that generic
systems with support M do not admit any solution at all. For these systems,
Hilbert's Nullstellensatz ensures the existence of algebraic certificates of
inconsistency. However, up to our knowledge all known bounds on the sizes of
such certificates -including those which take into account the Newton polytopes
of the polynomials- are exponential in n. Our main results show that if the
inequality 2|M| -- 2n \sqrt 1 + 8{\nu} -- 1 holds for a quadratic
fewnomial system -- where {\nu} is the matching number of a graph associated
with M, and |M| is the cardinality of M -- then there exists generically a
certificate of inconsistency of linear size (measured as the number of
coefficients in the ground field K). Moreover this certificate can be computed
within a polynomial number of arithmetic operations. Next, we evaluate how
often this inequality holds, and we give evidence that the probability that the
inequality is satisfied depends strongly on the number of squares. More
precisely, we show that if M is picked uniformly at random among the subsets of
n + k + 1 quadratic monomials containing at least (n 1/2+)
squares, then the probability that the inequality holds tends to 1 as n grows.
Interestingly, this phenomenon is related with the matching number of random
graphs in the Erd{\"o}s-Renyi model. Finally, we provide experimental results
showing that certificates in inconsistency can be computed for systems with
more than 10000 variables and equations.Comment: ISSAC 2016, Jul 2016, Waterloo, Canada. Proceedings of ISSAC 201
A Hybrid Observer for a Distributed Linear System with a Changing Neighbor Graph
A hybrid observer is described for estimating the state of an channel,
-dimensional, continuous-time, distributed linear system of the form
. The system's state is
simultaneously estimated by agents assuming each agent senses and
receives appropriately defined data from each of its current neighbors.
Neighbor relations are characterized by a time-varying directed graph
whose vertices correspond to agents and whose arcs depict
neighbor relations. Agent updates its estimate of at "event
times" using a local observer and a local parameter
estimator. The local observer is a continuous time linear system whose input is
and whose output is an asymptotically correct estimate of
where a matrix with kernel equaling the unobservable space of .
The local parameter estimator is a recursive algorithm designed to estimate,
prior to each event time , a constant parameter which satisfies the
linear equations , where is a small
positive constant and is the state estimation error of local observer
. Agent accomplishes this by iterating its parameter estimator state
, times within the interval , and by making use of
the state of each of its neighbors' parameter estimators at each iteration. The
updated value of at event time is then . Subject to the assumptions that (i) the neighbor graph
is strongly connected for all time, (ii) the system whose state
is to be estimated is jointly observable, (iii) is sufficiently large, it
is shown that each estimate converges to exponentially fast as
at a rate which can be controlled.Comment: 7 pages, the 56th IEEE Conference on Decision and Contro
Coarsening Strategies for Unstructured Multigrid Techniques with Application to Anisotropic Problems
Over the years, multigrid has been demonstrated as an efficient technique for solving inviscid flow problems. However, for viscous flows, convergence rates often degrade. This is generally due to the required use of stretched meshes (i.e., the aspect ratio AR = Δy/Δx < < 1) in order to capture the boundary layer near the body. Usual techniques for generating a sequence of grids that produce proper convergence rates on isotropic meshes are not adequate for stretched meshes. This work focuses on the solution of Laplace's equation, discretized through a Galerkin finite-element formulation on unstructured stretched triangular meshes. A coarsening strategy is proposed and results are discussed
- …