Latest content added for Digital Library Partner: UNT Librarieshttps://digital.library.unt.edu/explore/partners/UNT/browse/?fq=str_degree_discipline:Mathematics&fq=untl_decade:2000-2009&fq=untl_collection:UNTETD2010-09-10T01:20:16-05:00UNT LibrariesThis is a custom feed for browsing Digital Library Partner: UNT LibrariesLevel Curves of the Angle Function of a Positive Definite Symmetric Matrix2010-09-10T01:20:16-05:00https://digital.library.unt.edu/ark:/67531/metadc28376/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc28376/"><img alt="Level Curves of the Angle Function of a Positive Definite Symmetric Matrix" title="Level Curves of the Angle Function of a Positive Definite Symmetric Matrix" src="https://digital.library.unt.edu/ark:/67531/metadc28376/small/"/></a></p><p>Given a real N by N matrix A, write p(A) for the maximum angle by which A rotates any unit vector. Suppose that A and B are positive definite symmetric (PDS) N by N matrices. Then their Jordan product {A, B} := AB + BA is also symmetric, but not necessarily positive definite. If p(A) + p(B) is obtuse, then there exists a special orthogonal matrix S such that {A, SBS^(-1)} is indefinite. Of course, if A and B commute, then {A, B} is positive definite. Our work grows from the following question: if A and B are commuting positive definite symmetric matrices such that p(A) + p(B) is obtuse, what is the minimal p(S) such that {A, SBS^(-1)} indefinite? In this dissertation we will describe the level curves of the angle function mapping a unit vector x to the angle between x and Ax for a 3 by 3 PDS matrix A, and discuss their interaction with those of a second such matrix.</p>On the density of minimal free subflows of general symbolic flows.2009-11-19T20:18:23-06:00https://digital.library.unt.edu/ark:/67531/metadc11009/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc11009/"><img alt="On the density of minimal free subflows of general symbolic flows." title="On the density of minimal free subflows of general symbolic flows." src="https://digital.library.unt.edu/ark:/67531/metadc11009/small/"/></a></p><p>This paper studies symbolic dynamical systems {0, 1}G, where G is a countably infinite group, {0, 1}G has the product topology, and G acts on {0, 1}G by shifts. It is proven that for every countably infinite group G the union of the minimal free subflows of {0, 1}G is dense. In fact, a stronger result is obtained which states that if G is a countably infinite group and U is an open subset of {0, 1}G, then there is a collection of size continuum consisting of pairwise disjoint minimal free subflows intersecting U.</p>The Global Structure of Iterated Function Systems2009-10-10T16:41:03-05:00https://digital.library.unt.edu/ark:/67531/metadc9917/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc9917/"><img alt="The Global Structure of Iterated Function Systems" title="The Global Structure of Iterated Function Systems" src="https://digital.library.unt.edu/ark:/67531/metadc9917/small/"/></a></p><p>I study sets of attractors and non-attractors of finite iterated function systems. I provide examples of compact sets which are attractors of iterated function systems as well as compact sets which are not attractors of any iterated function system. I show that the set of all attractors is a dense Fs set and the space of all non-attractors is a dense Gd set it the space of all non-empty compact subsets of a space X. I also investigate the small trans-finite inductive dimension of the space of all attractors of iterated function systems generated by similarity maps on [0,1].</p>Urysohn ultrametric spaces and isometry groups.2009-10-10T16:41:00-05:00https://digital.library.unt.edu/ark:/67531/metadc9918/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc9918/"><img alt="Urysohn ultrametric spaces and isometry groups." title="Urysohn ultrametric spaces and isometry groups." src="https://digital.library.unt.edu/ark:/67531/metadc9918/small/"/></a></p><p>In this dissertation we study a special sub-collection of Polish metric spaces: complete separable ultrametric spaces. Polish metric spaces have been studied for quite a long while, and a lot of results have been obtained. Motivated by some of earlier research, we work on the following two main parts in this dissertation. In the first part, we show the existence of Urysohn Polish R-ultrametric spaces, for an arbitrary countable set R of non-negative numbers, including 0. Then we give point-by-point construction of a countable R-ultra-Urysohn space. We also obtain a complete characterization for the set R which corresponding to a R-Urysohn metric space. From this characterization we conclude that there exist R-Urysohn spaces for a wide family of countable R. Moreover, we determine the complexity of the classification of all Polish ultrametric spaces. In the second part, we investigate the isometry groups of Polish ultrametric spaces. We prove that isometry group of an Urysohn Polish R-ultrametric space is universal among isometry groups of Polish R-ultrametric spaces. We completely characterize the isometry groups of finite ultrametric spaces and the isometry groups of countable compact ultrametric spaces. Moreover, we give some necessary conditions for finite groups to be isomorphic to some isometry groups of finite ultrametric spaces.</p>A New Algorithm for Finding the Minimum Distance between Two Convex Hulls2009-09-23T14:51:12-05:00https://digital.library.unt.edu/ark:/67531/metadc9845/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc9845/"><img alt="A New Algorithm for Finding the Minimum Distance between Two Convex Hulls" title="A New Algorithm for Finding the Minimum Distance between Two Convex Hulls" src="https://digital.library.unt.edu/ark:/67531/metadc9845/small/"/></a></p><p>The problem of computing the minimum distance between two convex hulls has applications to many areas including robotics, computer graphics and path planning. Moreover, determining the minimum distance between two convex hulls plays a significant role in support vector machines (SVM). In this study, a new algorithm for finding the minimum distance between two convex hulls is proposed and investigated. A convergence of the algorithm is proved and applicability of the algorithm to support vector machines is demostrated. The performance of the new algorithm is compared with the performance of one of the most popular algorithms, the sequential minimal optimization (SMO) method. The new algorithm is simple to understand, easy to implement, and can be more efficient than the SMO method for many SVM problems.</p>Spaces of operators containing co and/or l ∞ with an application of vector measures.2009-05-11T20:08:27-05:00https://digital.library.unt.edu/ark:/67531/metadc9036/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc9036/"><img alt="Spaces of operators containing co and/or l ∞ with an application of vector measures." title="Spaces of operators containing co and/or l ∞ with an application of vector measures." src="https://digital.library.unt.edu/ark:/67531/metadc9036/small/"/></a></p><p>The Banach spaces L(X, Y), K(X, Y), Lw*(X*, Y), and Kw*(X*, Y) are studied to determine when they contain the classical Banach spaces co or l ∞. The complementation of the Banach space K(X, Y) in L(X, Y) is discussed as well as what impact this complementation has on the embedding of co or l∞ in K(X, Y) or L(X, Y). Results concerning the complementation of the Banach space Kw*(X*, Y) in Lw*(X*, Y) are also explored and how that complementation affects the embedding of co or l ∞ in Kw*(X*, Y) or Lw*(X*, Y). The l p spaces for 1 ≤ p < ∞ are studied to determine when the space of compact operators from one l p space to another contains co. The paper contains a new result which classifies these spaces of operators. Results of Kalton, Feder, and Emmanuele concerning the complementation of K(X, Y) in L(X, Y) are generalized. A new result using vector measures is given to provide more efficient proofs of theorems by Kalton, Feder, Emmanuele, Emmanuele and John, and Bator and Lewis as well as a new proof of the fact that l ∞ is prime.</p>A Constructive Method for Finding Critical Point of the Ginzburg-Landau Energy Functional2009-05-11T20:08:08-05:00https://digital.library.unt.edu/ark:/67531/metadc9075/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc9075/"><img alt="A Constructive Method for Finding Critical Point of the Ginzburg-Landau Energy Functional" title="A Constructive Method for Finding Critical Point of the Ginzburg-Landau Energy Functional" src="https://digital.library.unt.edu/ark:/67531/metadc9075/small/"/></a></p><p>In this work I present a constructive method for finding critical points of the Ginzburg-Landau energy functional using the method of Sobolev gradients. I give a description of the construction of the Sobolev gradient and obtain convergence results for continuous steepest descent with this gradient. I study the Ginzburg-Landau functional with magnetic field and the Ginzburg-Landau functional without magnetic field. I then present the numerical results I obtained by using steepest descent with the discretized Sobolev gradient.</p>Localized Radial Solutions for Nonlinear p-Laplacian Equation in RN2008-10-02T16:45:19-05:00https://digital.library.unt.edu/ark:/67531/metadc6059/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc6059/"><img alt="Localized Radial Solutions for Nonlinear p-Laplacian Equation in RN" title="Localized Radial Solutions for Nonlinear p-Laplacian Equation in RN" src="https://digital.library.unt.edu/ark:/67531/metadc6059/small/"/></a></p><p>We establish the existence of radial solutions to the p-Laplacian equation ∆p u + f(u)=0 in RN, where f behaves like |u|q-1 u when u is large and f(u) < 0 for small positive u. We show that for each nonnegative integer n, there is a localized solution u which has exactly n zeros. Also, we look for radial solutions of a superlinear Dirichlet problem in a ball. We show that for each nonnegative integer n, there is a solution u which has exactly n zeros. Here we give an alternate proof to that which was given by Castro and Kurepa.</p>Uniqueness Results for the Infinite Unitary, Orthogonal and Associated Groups2008-10-02T16:41:11-05:00https://digital.library.unt.edu/ark:/67531/metadc6136/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc6136/"><img alt="Uniqueness Results for the Infinite Unitary, Orthogonal and Associated Groups" title="Uniqueness Results for the Infinite Unitary, Orthogonal and Associated Groups" src="https://digital.library.unt.edu/ark:/67531/metadc6136/small/"/></a></p><p>Let H be a separable infinite dimensional complex Hilbert space, let U(H) be the Polish topological group of unitary operators on H, let G be a Polish topological group and φ:G→U(H) an algebraic isomorphism. Then φ is a topological isomorphism. The same theorem holds for the projective unitary group, for the group of *-automorphisms of L(H) and for the complex isometry group. If H is a separable real Hilbert space with dim(H)≥3, the theorem is also true for the orthogonal group O(H), for the projective orthogonal group and for the real isometry group. The theorem fails for U(H) if H is finite dimensional complex Hilbert space.</p>Compact Operators and the Schrödinger Equation2008-05-05T15:04:26-05:00https://digital.library.unt.edu/ark:/67531/metadc5453/<p><a href="https://digital.library.unt.edu/ark:/67531/metadc5453/"><img alt="Compact Operators and the Schrödinger Equation" title="Compact Operators and the Schrödinger Equation" src="https://digital.library.unt.edu/ark:/67531/metadc5453/small/"/></a></p><p>In this thesis I look at the theory of compact operators in a general Hilbert space, as well as the inverse of the Hamiltonian operator in the specific case of L2[a,b]. I show that this inverse is a compact, positive, and bounded linear operator. Also the eigenfunctions of this operator form a basis for the space of continuous functions as a subspace of L2[a,b]. A numerical method is proposed to solve for these eigenfunctions when the Hamiltonian is considered as an operator on Rn. The paper finishes with a discussion of examples of Schrödinger equations and the solutions.</p>