948 resultados para dynamical systems theory
Resumo:
The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.
Resumo:
In the author's joint paper [HJS] with Jest and Struwe, we discuss asymtotic limits of a self-dual Ginzburg-Landau functional involving a section of a line bundle over a closed Riemann surface and a connection on this bundle. In this paper, the author generalizes the above results [HJS] to the case of bounded domains.
Resumo:
Since dilute Bose gas condensates were first experimentally produced, the Gross-Pitaevskii equation has been successfully used as a descriptive tool. As a mean-field equation, it cannot by definition predict anything about the many-body quantum statistics of condensate. We show here that there are a class of dynamical systems where it cannot even make successful predictions about the mean-field behavior, starting with the process of evaporative cooling by which condensates are formed. Among others are parametric processes, such as photoassociation and dissociation of atomic and molecular condensates.
Resumo:
We prove two asymptotical estimates for minimizers of a Ginzburg-Landau functional of the form integral(Omega) [1/2 \del u\(2) + 1/4 epsilon(2) (1 - \u\(2))(2) W (x)] dx.
Resumo:
The paper studies existence, uniqueness, and stability of large-amplitude periodic cycles arising in Hopf bifurcation at infinity of autonomous control systems with bounded nonlinear feedback. We consider systems with functional nonlinearities of Landesman-Lazer type and a class of systems with hysteresis nonlinearities. The method is based on the technique of parameter functionalization and methods of monotone concave and convex operators. (C) 2001 Academic Press.
Resumo:
Uncontrolled systems (x) over dot is an element of Ax, where A is a non-empty compact set of matrices, and controlled systems (x) over dot is an element of Ax + Bu are considered. Higher-order systems 0 is an element of Px - Du, where and are sets of differential polynomials, are also studied. It is shown that, under natural conditions commonly occurring in robust control theory, with some mild additional restrictions, asymptotic stability of differential inclusions is guaranteed. The main results are variants of small-gain theorems and the principal technique used is the Krasnosel'skii-Pokrovskii principle of absence of bounded solutions.
Resumo:
An important feature of some conceptual modelling grammars is the features they provide to allow database designers to show real-world things may or may not possess a particular attribute or relationship. In the entity-relationship model, for example, the fact that a thing may not possess an attribute can be represented by using a special symbol to indicate that the attribute is optional. Similarly, the fact that a thing may or may not be involved in a relationship can be represented by showing the minimum cardinality of the relationship as zero. Whether these practices should be followed, however, is a contentious issue. An alternative approach is to eliminate optional attributes and relationships from conceptual schema diagrams by using subtypes that have only mandatory attributes and relationships. In this paper, we first present a theory that led us to predict that optional attributes and relationships should be used in conceptual schema diagrams only when users of the diagrams require a surface-level understanding of the domain being represented by the diagrams. When users require a deep-level understanding, however, optional attributes and relationships should not be used because they undermine users' abilities to grasp important domain semantics. We describe three experiments which we then undertook to test our predictions. The results of the experiments support our predictions.
Resumo:
A question is examined as to estimates of the norms of perturbations of a linear stable dynamic system, under which the perturbed system remains stable in a situation R:here a perturbation has a fixed structure.
Resumo:
Formulations of fuzzy integral equations in terms of the Aumann integral do not reflect the behavior of corresponding crisp models. Consequently, they are ill-adapted to describe physical phenomena, even when vagueness and uncertainty are present. A similar situation for fuzzy ODEs has been obviated by interpretation in terms of families of differential inclusions. The paper extends this formalism to fuzzy integral equations and shows that the resulting solution sets and attainability sets are fuzzy and far better descriptions of uncertain models involving integral equations. The investigation is restricted to Volterra type equations with mildly restrictive conditions, but the methods are capable of extensive generalization to other types and more general assumptions. The results are illustrated by integral equations relating to control models with fuzzy uncertainties.
Resumo:
Shadowing of a dynamical system is often used to justify the validity of computer simulations of the system, and in numerical calculations an inverse form of the shadowing concept is also of some interest. In this paper we characterize the notion of shadowing in terms of stability, and express the notion of hyperbolicity using the concept of inverse shadowing.
Resumo:
In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.