984 resultados para Converse Lyapunov theorem


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Preface signed: William Chauvenet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Cox's theorem states that, under certain assumptions, any measure of belief is isomorphic to a probability measure. This theorem, although intended as a justification of the subjectivist interpretation of probability theory, is sometimes presented as an argument for more controversial theses. Of particular interest is the thesis that the only coherent means of representing uncertainty is via the probability calculus. In this paper I examine the logical assumptions of Cox's theorem and I show how these impinge on the philosophical conclusions thought to be supported by the theorem. I show that the more controversial thesis is not supported by Cox's theorem. (C) 2003 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An algorithm for suppressing the chaotic oscillations in non-linear dynamical systems with singular Jacobian matrices is developed using a linear feedback control law based upon the Lyapunov-Krasovskii (LK) method. It appears that the LK method can serve effectively as a generalised method for the suppression of chaotic oscillations for a wide range of systems. Based on this method, the resulting conditions for undisturbed motions to be locally or globally stable are sufficient and conservative. The generalized Lorenz system and disturbed gyrostat equations are exemplified for the validation of the proposed feedback control rule. (c) 2005 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We provide an axiomatisation of the Timed Interval Calculus, a set-theoretic notation for expressing properties of time intervals. We implement the axiomatisation in the Ergo theorem prover in order to allow the machine-checked proof of laws for reasoning about predicates expressed using interval operators. These laws can be then used in the machine-assisted verification of real-time applications.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The recent development of using negative stiffness inclusions to achieve extreme overall stiffness and mechanical damping of composite materials reveals a new avenue for constructing high performance materials. One of the negative stiffness sources can be obtained from phase transforming materials in the vicinity of their phase transition, as suggested by the Landau theory. To understand the underlying mechanism from a microscopic viewpoint, we theoretically analyze a 2D, nested triangular lattice cell with pre-chosen elements containing negative stiffness to demonstrate anomalies in overall stiffness and damping. Combining with current knowledge from continuum models, based on the composite theory, such as the Voigt, Reuss, and Hashin-Shtrikman model, we further explore the stability of the system with Lyapunov's indirect stability theorem. The evolution of the microstructure in terms of the discrete system is discussed. A potential application of the results presented here is to develop special thin films with unusual in-plane mechanical properties. © 2006 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that of the well-known Vincent-Collins-Akritas method, which is the first bisection method derived from Vincent’s theorem back in 1976. Experimental results indicate that REL, the fastest implementation of the Vincent-Collins-Akritas method, is still the fastest of the three bisection methods, but the number of intervals it examines is almost the same as that of B. Therefore, further research on speeding up B while preserving its simplicity looks promising.