1000 resultados para Sistemes no lineals
Resumo:
L'objectiu que m'he proposat al preparar aquesta exposicióha estat el de mostrar. per una banda, com alguns delsproblemes bàsics de la teoria de Sistemes Dinàmics Linealstenen una resposta senzilla en termes de l' Álgebra lineal i,d'altra, com alguns problemes importants d'aquesta teorias'entronquen amb conceptes i tècniques bàsiques de la geometriai la topologia
Resumo:
Oferim als estudiants universitaris i als lectors interessats aquesta guia didàctica de la matemàtica universitària com a fruit dels nostres anys de docència de les matemàtiques a la Universitat. El resultat final ha esdevingut una col·lecció de setze petits volums agrupats en els dos mòduls d'Àlgebra Lineal i de Càlcul Infinitesimal. En aquest volum es comença definint la terminologia bàsica dels sistemes, utilitzant la nomenclatura i els conceptes apresos en els volums anteriors. A partir del concepte de rang d’una matriu es dedueix l’important teorema de Rouché-Fröbenius en el qual s’analitzen les condicions perquè un sistema sigui compatible, i a continuació s’introdueixen els principals mètodes de resolució de sistemes d’equacions lineals. Finalment, es fa un breu estudi dels sistemes d’equacions no lineals, i dels sistemes d’equacions diofàntiques que són aquells en què només té sentit considerar les solucions enteres de les incògnites
Resumo:
A variational method for Hamiltonian systems is analyzed. Two different variationalcharacterization for the frequency of nonlinear oscillations is also suppliedfor non-Hamiltonian systems
Resumo:
We study nonstationary non-Markovian processes defined by Langevin-type stochastic differential equations with an OrnsteinUhlenbeck driving force. We concentrate on the long time limit of the dynamical evolution. We derive an approximate equation for the correlation function of a nonlinear nonstationary non-Markovian process, and we discuss its consequences. Non-Markovicity can introduce a dependence on noise parameters in the dynamics of the correlation function in cases in which it becomes independent of these parameters in the Markovian limit. Several examples are discussed in which the relaxation time increases with respect to the Markovian limit. For a Brownian harmonic oscillator with fluctuating frequency, the non-Markovicity of the process decreases the domain of stability of the system, and it can change an infradamped evolution into an overdamped one.
Resumo:
The Lorentz-Dirac equation is not an unavoidable consequence of solely linear and angular momenta conservation for a point charge. It also requires an additional assumption concerning the elementary character of the charge. We here use a less restrictive elementarity assumption for a spinless charge and derive a system of conservation equations that are not properly the equation of motion because, as it contains an extra scalar variable, the future evolution of the charge is not determined. We show that a supplementary constitutive relation can be added so that the motion is determined and free from the troubles that are customary in the Lorentz-Dirac equation, i.e., preacceleration and runaways.
Resumo:
We study theoretical and empirical aspects of the mean exit time (MET) of financial time series. The theoretical modeling is done within the framework of continuous time random walk. We empirically verify that the mean exit time follows a quadratic scaling law and it has associated a prefactor which is specific to the analyzed stock. We perform a series of statistical tests to determine which kind of correlation are responsible for this specificity. The main contribution is associated with the autocorrelation property of stock returns. We introduce and solve analytically both two-state and three-state Markov chain models. The analytical results obtained with the two-state Markov chain model allows us to obtain a data collapse of the 20 measured MET profiles in a single master curve.
Resumo:
We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in that it involves the properties of two¿and not just one¿vertices. The formalism is completed with the definition of a three-vertex correlation function, which is the fundamental quantity describing the properties of clustered networks. The formalism suggests different metrics that are able to thoroughly characterize transitive relations. A rigorous analysis of several real networks, which makes use of this formalism and the metrics, is also provided. It is also found that clustered networks can be classified into two main groups: the weak and the strong transitivity classes. In the first class, edge multiplicity is small, with triangles being disjoint. In the second class, edge multiplicity is high and so triangles share many edges. As we shall see in the following paper, the class a network belongs to has strong implications in its percolation properties.
Resumo:
The nonexponential relaxation occurring in complex dynamics manifested in a wide variety of systems is analyzed through a simple model of diffusion in phase space. It is found that the inability of the system to find its equilibrium state in any time scale becomes apparent in an effective temperature field, which leads to a hierarchy of relaxation times responsible for the slow relaxation phenomena.
Resumo:
A recent paper by J. Heinrichs [Phys. Rev. E 48, 2397 (1993)] presents analytic expressions for the first-passage times and the survival probability for a particle moving in a field of random correlated forces. We believe that the analysis there is flawed due to an improper use of boundary conditions. We compare that result, in the white noise limit, with the known exact expression of the mean exit time.
Resumo:
A stochastic nonlinear partial differential equation is constructed for two different models exhibiting self-organized criticality: the Bak-Tang-Wiesenfeld (BTW) sandpile model [Phys. Rev. Lett. 59, 381 (1987); Phys. Rev. A 38, 364 (1988)] and the Zhang model [Phys. Rev. Lett. 63, 470 (1989)]. The dynamic renormalization group (DRG) enables one to compute the critical exponents. However, the nontrivial stable fixed point of the DRG transformation is unreachable for the original parameters of the models. We introduce an alternative regularization of the step function involved in the threshold condition, which breaks the symmetry of the BTW model. Although the symmetry properties of the two models are different, it is shown that they both belong to the same universality class. In this case the DRG procedure leads to a symmetric behavior for both models, restoring the broken symmetry, and makes accessible the nontrivial fixed point. This technique could also be applied to other problems with threshold dynamics.
Resumo:
In this paper we consider an exactly solvable model that displays glassy behavior at zero temperature due to entropic barriers. The new ingredient of the model is the existence of different energy scales or modes associated with different relaxational time scales. Low-temperature relaxation takes place by partial equilibration of successive lower-energy modes. An adiabatic scaling solution, defined in terms of a threshold energy scale e*, is proposed. For such a solution, modes with energy ee* are equilibrated at the bath temperature, modes with ee* remain out of equilibrium, and relaxation occurs in the neighborhood of the threshold e~e*. The model is presented as a toy example to investigate the conditions related to the existence of an effective temperature in glassy systems and its possible dependence on the energy sector is probed by the corresponding observable.
Resumo:
The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows us to find the critical threshold and the size of the giant component. Numerical simulations confirm the accuracy of our results. In more general terms, we show that weak clustering hinders the onset of the giant component whereas strong clustering favors its appearance. This is a direct consequence of the differences in the k-core structure of the networks, which are found to be totally different depending on the level of clustering. An empirical analysis of a real social network confirms our predictions.
Resumo:
We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure of triangles and second the classical closure of remaining free stubs. The procedure unveils an universal relation among clustering and degree-degree correlations for all networks, where the level of assortativity establishes an upper limit to the level of clustering. Maximum assortativity ensures no restriction on the decay of the clustering coefficient whereas disassortativity sets a stronger constraint on its behavior. Correlation measures in real networks are seen to observe this structural bound.