• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 189
  • 35
  • 1
  • Tagged with
  • 431
  • 431
  • 156
  • 152
  • 150
  • 124
  • 108
  • 108
  • 79
  • 53
  • 52
  • 45
  • 43
  • 39
  • 35
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
241

A Study of Symmetric Forced Oscillators

Ben-Tal, Alona January 2001 (has links)
In this thesis we study a class of symmetric forced oscillators modeled by non-linear ordinary differential equations. Solutions for this class of systems can be symmetric or non-symmetric. When a symmetric periodic solution loses its stability as a physical parameter is varied, and two non-symmetric periodic solutions appear, this is called a symmetry breaking bifurcation. In a symmetry increasing bifurcation two conjugate chaotic attractors (i.e.,attractors which are related to each other by the symmetry) collide and form a larger symmetric chaotic attractor. Symmetry can also be restored via explosions where, as a physical parameter is varied, two conjugate attractors (chaotic or periodic) which do not intersect are suddenly embedded in one symmetric attractor. In this thesis we show that all these apparently distinct bifurcations can be realized by a single mechanism in which two conjugate attractors collide with a symmetric limit set. The same mechanism seems to operate for at least some bifurcations involving non-attracting limit sets. We illustrate this point with examples of symmetry restoration in attracting and non-attracting sets found in the forced Duffing oscillator and in a power system. Symmetry restoration in the power system is associated with a phenomenon known as ferroresonance. The study of the ferroresonance phenomenon motivated this thesis. Part of this thesis is devoted to studying one aspect of the ferroresonance phenomenon the appearance of a strange attractor with a band-like structure. This attractor was called previously a 'pseudo-periodic' attractor. Some methods for analyzing the non-autonomous systems under study are shown. We construct three different maps which highlight different features of symmetry restoring bifurcations. One map in particular captures the symmetry of a solution by sampling it every half the period of the forcing. We describe a numerical method to construct a bifurcation diagram of periodic solutions and present a non-standard approach for converting the forced oscillator to an autonomous system.
242

Ethnomathematics: Exploring Cultural Diversity in Mathematics

Barton, Bill, 1948- January 1996 (has links)
This thesis provides a new conceptualisation of ethnomathematics which avoids some of the difficulties which emerge in the literature. In particular, work has been started on a philosophic basis for the field. There is no consistent view of ethnomathematics in the literature. The relationship with mathematics itself has been ignored, and the philosophical and theoretical background is missing. The literature also reveals the ethnocentricity implied by ethnomathematics as a field of study based in a culture which has mathematics as a knowledge category. Two strategies to over come this problem are identified: universalising the referent of ‘mathematics’ so that it is the same as “knowledge-making”; or using methodological techniques to minimise it. The position of ethnomathematics in relationship to anthropology, sociology, history, and politics is characterised on a matrix. A place for ethnomathematics is found close the anthropology of mathematics, but the aim of anthropology is to better understand culture in general, while ethnomathematics aims to better understand mathematics. Anthropology, however, contributes its well-established methodologies for overcoming ethnocentricity. The search for a philosophical base finds a Wittgensteinian orientation which enables culturally based ‘systems of meaning’ to gain credibility in mathematics. A definition is proposed for ethnomathematics as the study of mathematical practices within context. Four types of ethnomathematical activity are identified: descriptive, archaeological, mathematising, and analytical activity. The definition also gives rise to a categorisation of ethnomathematical work along three dimensions: the closeness to conventional mathematics; the historical time; and the type of host culture. The mechanisms of interaction between mathematical practices are identified, and the imperialistic growth of mathematics is explained. Particular features of ethnomathematical theory are brought out in a four examples. By admitting the legitimacy of other viewpoints, ethnomathematics opens mathematics to new creative forces. Within education, ethnomathematics provides new choices, and turns cultural conflict into a useful tool for teaching. Mathematical activity exists in a variety of contexts. Learning mathematics involves being aware of, and integrating, diverse concepts. Ethnomathematics expands mathematical horizons, so that cultural diversity becomes a richer contributor to the cultural structures which humans use to understand their world.
243

Stochastic models of election timing

Lesmono, Dharma Unknown Date (has links)
Under the democratic systems of government instilled in many sovereign states, the party in government maintains a constitutional right to call an early election. While the constitution states that there is a maximum period between elections, early elections are frequently called. This right to call an early election gives the government a control to maximize its remaining life in power. The optimal control for the government is found by locating an exercise boundary that indicates whether or not a premature election should be called. This problem draws upon the body of literature on optimal stopping problems and stochastic control. Morgan Poll’s two-party-preferred data are used to model the behaviour of the poll process and a mean reverting Stochastic Differential Equation (SDE) is fitted to these data. Parameters of this SDE are estimated using the Maximum Likelihood Estimation (MLE) Method. Analytic analysis of the SDE for the poll process is given and it will be proven that there is a unique solution to the SDE subject to some conditions. In the first layer, a discrete time model is developed by considering a binary control for the government, viz. calling an early election or not. A comparison between a three-year and a four-year maximum term is also given. A condition when the early exercise option is removed, which leads to a fixed term government such as in the USA is also considered. In the next layer, the possibility for the government to use some control tools that are termed as ‘boosts’ to induce shocks to the opinion polls by making timely policy announcements or economic actions is also considered. These actions will improve the government’s popularity and will have some impacts upon the early-election exercise boundary. An extension is also given by allowing the government to choose the size of its ‘boosts’ to maximize its expected remaining life in power. In the next layer, a continuous time model for this election timing is developed by using a martingale approach and Ito’s Lemma which leads to a problem of solving a partial differential equation (PDE) along with some boundary conditions. Another condition considered is when the government can only call an election and the opposition can apply ‘boosts’ to raise its popularity or just to pull government’s popularity down. The ultimate case analysed is when both the government and the opposition can use ‘boosts’ and the government still has option to call an early election. In these two cases a game theory approach is employed and results are given in terms of the expected remaining life in power and the probability of calling and using ‘boosts’ at every time step and at certain level of popularity.
244

A game-theoretic view on intermediated exchange /

Grassl, Thomas. January 1900 (has links) (PDF)
Thesis (Ph.D.)--Michigan Technological University, 2007. / Includes bibliographical references. Also available on the World Wide Web.
245

Automatic structures

Rubin, Sasha January 2004 (has links)
This thesis investigates structures that are presentable by finite automata working synchronously on tuples of finite words. The emphasis is on understanding the expressiveness and limitations of automata in this setting. In particular, the thesis studies the classification of classes of automatic structures, the complexity of the isomorphism problem, and the relationship between definability and recognisability.
246

Hyperbolic Geometry and Reflection Groups

Marshall, T. H. (Timothy Hamilton) January 1994 (has links)
The n-dimensional pseudospheres are the surfaces in Rn+l given by the equations x12+x22+...+xk2-xk+12-...-xn+12=1(1 ≤ k ≤ n+1). The cases k=l, n+1 give, respectively a pair of hyperboloids, and the ordinary n-sphere. In the first chapter we consider the pseudospheres as surfaces h En+1,k, where Em,k=Rk x (iR)m-k, and investigate their geometry in terms of the linear algebra of these spaces. The main objects of investigation are finite sequences of hyperplanes in a pseudosphere. To each such sequence we associate a square symmetric matrix, the Gram matrix, which gives information about angle and incidence properties of the hyperplanes. We find when a given matrix is the Gram matrix of some sequence of hyperplanes, and when a sequence is determined up to isometry by its Gram matrix. We also consider subspaces of pseudospheres and projections onto them. This leads to an n-dimensional cosine rule for spherical and hyperbolic simplices. In the second chapter we derive integral formulae for the volume of an n-dimensional spherical or hyperbolic simplex, both in terms of its dihedral angles and its edge lengths. For the regular simplex with common edge length γ we then derive power series for the volume, both in u = sinγ/2, and in γ itself, and discuss some of the properties of the coefficients. In obtaining these series we encounter an interesting family of entire functions, Rn(p) (n a nonnegative integer and pεC). We derive a functional equation relating Rn(p) and Rn-1(p). Finally we classify, up to isometry, all tetrahedra with one or more vertices truncated, for which the dihedral angles along the edges formed by the truncatons. are all π/2, and the remaining dihedral angles are all sub-multiples of π. We show how to find the volumes of these polyhedra, and find presentations and small generating sets for the orientation-preserving subgroups of their reflection groups. For particular families of these groups, we find low index torsion free subgroups, and construct associated manifolds and manifolds with boundary In particular, we find a sequence of manifolds with totally geodesic boundary of genus, g≥2, which we conjecture to be of least volume among such manifolds.
247

Stability and efficiency properties of implicit Runge-Kutta methods

Burrage, Kevin January 1978 (has links)
This thesis is divided into two sections. The first section examines certain stability properties of implicit Runge-Kutta methods. In particular, a new stability property is defined, which is a modification to non-autonomous problems of A-stability, and its relation to B-stability is considered. A Runge-Kutta method is written as [see 01front.pdf for graphic] and classes of methods are constructed based on the property ∑sj=1aijck-1j = cki/k, i = 1,...,s and k = 1,...,s-1, where c1,...,cs are assumed to be distinct. Under this assumption a transformation is made, such that A = VsAsV-1s, where Vs is the Vandermonde matrix whose (i,j) element is cj-1i, and As has a special structure. These methods are examined in the light of the various stability criteria. It is also shown that the growth of errors can be estimated by an extension of this new stability theory and a number of examples are given. In the second section we consider the solution of stiff differential equations by implicit Runge-Kutta methods. In particular, we examine a procedure suggested by Butcher [6] which enables an efficient implementation of Runge-Kutta methods. He has shown that the most efficient methods when using this implementation are those whose characteristic polynomial of the Runge-Kutta matrix has a single real s-fold zero. Based on this criterion a family of methods, called singly-implicit methods, is constructed, and results concerning their maximum attainable order and stability properties are given. Some consideration is also given to showing how local error estimates can be obtained, by the use of embedding techniques, for both singly-implicit methods and the more general family of implicit Runge-Kutta methods. Finally, an algorithm based on these singly-implicit methods is presented. It is tested on a number of stiff differential equations, and comparisons are made between this algorithm and others currently in use.
248

Almost Runge-Kutta methods for stiff and non-stiff problems

Rattenbury, Nicolette January 2005 (has links)
Ordinary differential equations arise frequently in the study of the physical world. Unfortunately many cannot be solved exactly. This is why the ability to solve these equations numerically is important. Traditionally mathematicians have used one of two classes of methods for numerically solving ordinary differential equations. These are linear multistep methods and Runge–Kutta methods. General linear methods were introduced as a unifying framework for these traditional methods. They have both the multi-stage nature of Runge–Kutta methods as well as the multi-value nature of linear multistep methods. This extremely broad class of methods, besides containing Runge–Kutta and linear multistep methods as special cases, also contains hybrid methods, cyclic composite linear multistep methods and pseudo Runge–Kutta methods. In this thesis we present a class of methods known as Almost Runge–Kutta methods. This is a special class of general linear methods which retains many of the properties of traditional Runge–Kutta methods, but with some advantages. Most of this thesis concentrates on explicit methods for non-stiff differential equations, paying particular attention to a special fourth order method which, when implemented in the correct way, behaves like order five. We will also introduce low order diagonally implicit methods for solving stiff differential equations.
249

A Study of Symmetric Forced Oscillators

Ben-Tal, Alona January 2001 (has links)
In this thesis we study a class of symmetric forced oscillators modeled by non-linear ordinary differential equations. Solutions for this class of systems can be symmetric or non-symmetric. When a symmetric periodic solution loses its stability as a physical parameter is varied, and two non-symmetric periodic solutions appear, this is called a symmetry breaking bifurcation. In a symmetry increasing bifurcation two conjugate chaotic attractors (i.e.,attractors which are related to each other by the symmetry) collide and form a larger symmetric chaotic attractor. Symmetry can also be restored via explosions where, as a physical parameter is varied, two conjugate attractors (chaotic or periodic) which do not intersect are suddenly embedded in one symmetric attractor. In this thesis we show that all these apparently distinct bifurcations can be realized by a single mechanism in which two conjugate attractors collide with a symmetric limit set. The same mechanism seems to operate for at least some bifurcations involving non-attracting limit sets. We illustrate this point with examples of symmetry restoration in attracting and non-attracting sets found in the forced Duffing oscillator and in a power system. Symmetry restoration in the power system is associated with a phenomenon known as ferroresonance. The study of the ferroresonance phenomenon motivated this thesis. Part of this thesis is devoted to studying one aspect of the ferroresonance phenomenon the appearance of a strange attractor with a band-like structure. This attractor was called previously a 'pseudo-periodic' attractor. Some methods for analyzing the non-autonomous systems under study are shown. We construct three different maps which highlight different features of symmetry restoring bifurcations. One map in particular captures the symmetry of a solution by sampling it every half the period of the forcing. We describe a numerical method to construct a bifurcation diagram of periodic solutions and present a non-standard approach for converting the forced oscillator to an autonomous system.
250

Ethnomathematics: Exploring Cultural Diversity in Mathematics

Barton, Bill, 1948- January 1996 (has links)
This thesis provides a new conceptualisation of ethnomathematics which avoids some of the difficulties which emerge in the literature. In particular, work has been started on a philosophic basis for the field. There is no consistent view of ethnomathematics in the literature. The relationship with mathematics itself has been ignored, and the philosophical and theoretical background is missing. The literature also reveals the ethnocentricity implied by ethnomathematics as a field of study based in a culture which has mathematics as a knowledge category. Two strategies to over come this problem are identified: universalising the referent of ‘mathematics’ so that it is the same as “knowledge-making”; or using methodological techniques to minimise it. The position of ethnomathematics in relationship to anthropology, sociology, history, and politics is characterised on a matrix. A place for ethnomathematics is found close the anthropology of mathematics, but the aim of anthropology is to better understand culture in general, while ethnomathematics aims to better understand mathematics. Anthropology, however, contributes its well-established methodologies for overcoming ethnocentricity. The search for a philosophical base finds a Wittgensteinian orientation which enables culturally based ‘systems of meaning’ to gain credibility in mathematics. A definition is proposed for ethnomathematics as the study of mathematical practices within context. Four types of ethnomathematical activity are identified: descriptive, archaeological, mathematising, and analytical activity. The definition also gives rise to a categorisation of ethnomathematical work along three dimensions: the closeness to conventional mathematics; the historical time; and the type of host culture. The mechanisms of interaction between mathematical practices are identified, and the imperialistic growth of mathematics is explained. Particular features of ethnomathematical theory are brought out in a four examples. By admitting the legitimacy of other viewpoints, ethnomathematics opens mathematics to new creative forces. Within education, ethnomathematics provides new choices, and turns cultural conflict into a useful tool for teaching. Mathematical activity exists in a variety of contexts. Learning mathematics involves being aware of, and integrating, diverse concepts. Ethnomathematics expands mathematical horizons, so that cultural diversity becomes a richer contributor to the cultural structures which humans use to understand their world.

Page generated in 0.0907 seconds