Open Access. Powered by Scholars. Published by Universities.®

Dynamical Systems Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Dynamical Systems

Factoring Families Of Positive Knots On Lorenz-Like Templates, Michael C. Sullivan Oct 2008

Factoring Families Of Positive Knots On Lorenz-Like Templates, Michael C. Sullivan

Articles and Preprints

We show that for m and n positive, composite closed orbits realized on the Lorenz-like template L(m, n) have two prime factors, each a torus knot; and that composite closed orbits on L(−1,−1) have either two for three prime factors, two of which are torus knots.


Identifying Almost Invariant Sets In Stochastic Dynamical Systems, Lora Billings, Ira Schwartz Jan 2008

Identifying Almost Invariant Sets In Stochastic Dynamical Systems, Lora Billings, Ira Schwartz

Department of Mathematics Faculty Scholarship and Creative Works

We consider the approximation of fluctuation induced almost invariant sets arising from stochastic dynamical systems. The dynamical evolution of densities is derived from the stochastic Frobenius– Perron operator. Given a stochastic kernel with a known distribution, approximate almost invariant sets are found by translating the problem into an eigenvalue problem derived from reversible Markov processes. Analytic and computational examples of the methods are used to illustrate the technique, and are shown to reveal the probability transport between almost invariant sets in nonlinear stochastic systems. Both small and large noise cases are considered. © 2008 American Institute of Physics.


Non-Preemptive Shunting In M/M/1 And Dynamic Service Queueing Systems, Steven Lacek Jan 2008

Non-Preemptive Shunting In M/M/1 And Dynamic Service Queueing Systems, Steven Lacek

Theses, Dissertations and Capstones

We provide a study of two queueing systems, namely, an M/M/1 queueing system in which an incoming customer shunts, or skips line, and a dynamic server in an infinite capacity system moving among service nodes. In the former, we explore various aspects of the system, including waiting time, and the relationships between shunting and position in queue and rate of service. Through use of global balance equations, we find the probability that an arriving non-priority customer, finding customers waiting in the system, will shunt to a position other than behind the queue. In the latter, we explore a system in …


Iterated Aluthge Transforms: A Brief Survey, Jorge Antezana, Enrique R. Pujals, Demetrio Stojanoff Jan 2008

Iterated Aluthge Transforms: A Brief Survey, Jorge Antezana, Enrique R. Pujals, Demetrio Stojanoff

Publications and Research

Given an r × r complex matrix T, if T = U|T| is the polar decomposition of T, then the Aluthge transform is defined by

∆(T) = |T|1/2U|T|1/2.

Let ∆n(T) denote the n-times iterated Aluthge transform of T, i.e. ∆0(T) = T and ∆n(T) = ∆(∆n−1(T)), nN. In this paper we make a brief survey on the known properties and applications of …


Super Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2008

Super Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book, the authors introduce the notion of Super linear algebra and super vector spaces using the definition of super matrices defined by Horst (1963). This book expects the readers to be well-versed in linear algebra. Many theorems on super linear algebra and its properties are proved. Some theorems are left as exercises for the reader. These new class of super linear algebras which can be thought of as a set of linear algebras, following a stipulated condition, will find applications in several fields using computers. The authors feel that such a paradigm shift is essential in this computerized …