• A temperature only formulation for ice sheets

      Gillispie, Lyman; Bueler, Edward; Allman, Elizabeth; Maxwell, David (2014-05)
      Temperature plays an important role in the dynamics of large flowing ice masses like glaciers and ice sheets. Because of this role many models for ice sheets model temperature in some form. One type of model for polythermal glaciers (glaciers which contain both ice below, and at the pressure-melting temperature) explicitly separates the ice into distinct cold and temperate regimes, and tracks the interface between them as a surface. Other models track the enthalpy (internal energy) across both domains, with temperature being a function of enthalpy. We present an alternative mathematical formulation for polythermal glaciers and ice-sheets, in the form of a variational inequality for the temperature field only. Using the calculus of variations, we establish some sufficient conditions under which our formulation is well-posed. We then present some numerical approximations of solutions obtained via the Finite Element Method.
    • Control And Inverse Problems For One Dimensional Systems

      Mikhaylov, Victor S. (2009)
      The thesis is devoted to control and inverse problems (dynamical and spectral) for systems on graphs and on the half line. In the first part we study the boundary control problems for the wave, heat, and Schrodinger equations on a finite graph. We suppose that the graph is a tree (i.e., it does not contain cycles), and on each edge an equation is defined. The control is acting through the Dirichlet condition applied to all or all but one boundary vertices. The exact controllability in L2-classes of controls is proved and sharp estimates of the time of controllability are obtained for the wave equation. The null controllability for the heat equation and exact controllability for the Schrodinger equation in arbitrary time interval are obtained. In the second part we consider the in-plane motion of elastic strings on a tree-like network, observed from the 'leaves.' We investigate the inverse problem of recovering not only the physical properties, i.e. the 'optical lengths' of each string, but also the topology of the tree which is represented by the edge degrees and the angles between branching edges. It is shown that under generic assumptions the inverse problem can be solved by applying measurements at all leaves, the root of the tree being fixed. In the third part of the thesis we consider Inverse dynamical and spectral problems for the Schrodinger operator on the half line. Using the connection between dynamical (Boundary Control method) and spectral approaches (due to Krein, Gelfand-Levitan, Simon and Remling), we improved the result on the representation of so-called A---amplitude and derive the "local" version of the classical Gelfand-Levitan equations.
    • Control Theoretic Approach To Sampling And Approximation Problems

      Bulanova, Anna S. (2009)
      We present applications of some methods of control theory to problems of signal processing and optimal quadrature problems. The following problems are considered: construction of sampling and interpolating sequences for multi-band signals; spectral estimation of signals modeled by a finite sum of exponentials modulated by polynomials; construction of optimal quadrature formulae for integrands determined by solutions of initial boundary value problems. A multi-band signal is a function whose Fourier transform is supported on a finite union of intervals. The approach used in Chapter I is based on connections between the sampling and interpolation problem and the problem of the controllability of a dynamical system. We prove that there exist infinitely many sampling and interpolating sequences for signals whose spectra are supported on a union of two disjoint intervals, and provide an algorithm for construction of such sequences. There exist numerous methods for solving the spectral estimation problem. In Chapter II we introduce a new approach to this problem based on the Boundary Control method, which uses the connection between inverse problems of mathematical physics and control theory for partial differential equations. Using samples of the signal at integer moments of time we construct a convolution operator regarded as an input-output map of a linear discrete dynamical system. This system can be identified, and the exponents and amplitudes of the signal can be found from the parameters of the system. We show that the coefficients of the signal can be recovered by solving a generalized eigenvalue problem as in the Matrix Pencil method. Our method allows to consider signals with polynomial amplitudes, and we obtain an exact formula for these amplitudes. In the third chapter we consider an optimal quadrature problem for solutions of initial boundary value problems. The problem of optimization of an error functional over the set of solutions and quadrature weights is a problem of optimal control of partial differential equations. We obtain estimates for the error in quadrature formulae and an optimality condition for quadrature weights.
    • Exact and numerical solutions for stokes flow in glaciers

      Mitchell, William H. (2012-08)
      We begin with an overview of the fluid mechanics governing ice flow. We review a 1985 result due to Balise and Raymond giving exact solutions for a glaciologically-relevant Stokes problem. We extend this result by giving exact formulas for the pressure and for the basal stress. This leads to a theorem giving a necessary condition on the basal velocity of a gravity-induced flow in a rectangular geometry. We describe the finite element method for solving the same problem numerically. We present a concise implementation using FEniCS, a freely-available software package, and discuss the convergence of the numerical method to the exact solution. We describe how to fix an error in a recent published model.
    • An existence theorem for solutions to a model problem with Yamabe-positive metric for conformal parameterizations of the Einstein constraint equations

      Knowles, Tyler D.; Maxwell, David; Rhodes, John A.; Rybkin, Alexei (2016-08)
      We use the conformal method to investigate solutions of the vacuum Einstein constraint equations on a manifold with a Yamabe-positive metric. To do so, we develop a model problem with symmetric data on Sn⁻¹ x S¹. We specialize the model problem to a two-parameter family of conformal data, and find that no solutions exist when the transverse-traceless tensor is identically zero. When the transverse traceless tensor is nonzero, we observe an existence theorem in both the near-constant mean curvature and far-from-constant mean curvature regimes.
    • Expectation maximization and latent class models

      Banos, Hector; Allman, Elizabeth; Faudree, Jill; Barry, Ron; Bueler, Edward (2016-05)
      Latent tree models are tree structured graphical models where some random variables are observable while others are latent. These models are used to model data in many areas, such as bioinformatics, phylogenetics, computer vision among others. This work contains some background on latent tree models and algebraic geometry with the goal of estimating the volume of the latent tree model known as the 3-leaf model M₂ (where the root is a hidden variable with 2 states, and is the parent of three observable variables with 2 states) in the probability simplex Δ₇, and to estimate the volume of the latent tree model known as the 3-leaf model M₃ (where the root is a hidden variable with 3 states, and is the parent of two observable variables with 3 states and one observable variable with 2 states) in the probability simplex Δ₁₇. For the model M₃, we estimate that the rough percentage of distributions that arise from stochastic parameters is 0:015%, the rough percentage of distributions that arise from real parameters is 64:742% and the rough percentage of distributions that arise from complex parameters is 35:206%. We will also discuss the algebraic boundary of these models and we observe the behavior of the estimates of the Expectation Maximization algorithm (EM algorithm), an iterative method typically used to try to find a maximum likelihood estimator.
    • An exploration of two infinite families of snarks

      Ver Hoef, Lander; Berman, Leah; Williams, Gordon; Faudree, Jill (2019-05)
      In this paper, we generalize a single example of a snark that admits a drawing with even rotational symmetry into two infinite families using a voltage graph construction techniques derived from cyclic Pseudo-Loupekine snarks. We expose an enforced chirality in coloring the underlying 5-pole that generated the known example, and use this fact to show that the infinite families are in fact snarks. We explore the construction of these families in terms of the blowup construction. We show that a graph in either family with rotational symmetry of order m has automorphism group of order m2m⁺¹. The oddness of graphs in both families is determined exactly, and shown to increase linearly with the order of rotational symmetry.
    • An exposition on the Kronecker-Weber theorem

      Baggett, Jason A. (2011-05)
      The Kronecker-Weber Theorem is a, classification result from Algebraic Number Theory. Theorem (Kronecker-Weber). Every finite, abelian extension of Q is contained in a cyclotomic field. This result was originally proven by Leopold Kronecker in 1853. However, his proof had some gaps that were later filled by Heinrich Martin Weber in 1886 and David Hilbert in 1896. Hilbert's strategy for the proof eventually led to the creation of the field of mathematics called Class Field Theory, which is the study of finite, abelian extensions of arbitrary fields and is still an area of active research. Not only is the Kronecker-Weber Theorem surprising, its proof is truly amazing. The idea of the proof is that for a finite, Galois extension K of Q, there is a connection between the Galois group Gal(K/Q) and how primes of Z split in a certain subring R of K corresponding to Z in Q. When Gal(K/Q) is abelian, this connection is so stringent that the only possibility is that K is contained in a cyclotomic field. In this paper, we give an overview of field/Galois theory and what the Kronecker-Weber Theorem means. We also talk about the ring of integers R of K, how primes split in R, how splitting of primes is related to the Galois group Gal(K/Q), and finally give a proof of the Kronecker-Weber Theorem using these ideas.
    • The geometry in geometric algebra

      Kilpatrick, Kristopher N.; Maxwell, David A.; Williams, Gordon I.; Rhodes, John A. (2014-12)
      We present an axiomatic development of geometric algebra. One may think of a geometric algebra as allowing one to add and multiply subspaces of a vector space. Properties of the geometric product are proven and derived products called the wedge and contraction product are introduced. Linear algebraic and geometric concepts such as linear independence and orthogonality may be expressed through the above derived products. Some examples with geometric algebra are then given.
    • Investigations in phylogenetics: tree inference and model identifiability

      Yourdkhani, Samaneh; Rhodes, John A.; Allman, Elizabeth S.; McIntyre, Julie; Williams, Gordon (2020-05)
      This thesis presents two projects in mathematical phylogenetics. The first presents a new, statistically consistent, fast method for inferring species trees from topological gene trees under the multispecies coalescent model. The algorithm of this method takes a collection of unrooted topological gene trees, computes a novel intertaxon distance from them, and outputs a metric species tree. The second establishes that numerical and non-numerical parameters of a specic Prole Mixture Model of protein sequence evolution are generically identifiable. Algebraic techniques are used, especially a theorem of Kruskal on tensor decomposition.
    • Linear partial differential equations and real analytic approximations of rough functions

      Barry, Timothy J.; Rybkin, Alexei; Avdonin, Sergei; Faudree, Jill (2017-08)
      Many common approximation methods exist such as linear or polynomial interpolation, splines, Taylor series, or generalized Fourier series. Unfortunately, many of these approximations are not analytic functions on the entire real line, and those that are diverge at infinity and therefore are only valid on a closed interval or for compactly supported functions. Our method takes advantage of the smoothing properties of certain linear partial differential equations to obtain an approximation which is real analytic, converges to the function on the entire real line, and yields particular conservation laws. This approximation method applies to any L₂ function on the real line which may have some rough behavior such as discontinuities or points of nondifferentiability. For comparison, we consider the well-known Fourier-Hermite series approximation. Finally, for some example functions the approximations are found and plotted numerically.
    • Non-Normality In Scalar Delay Differential Equations

      Stroh, Jacob Nathaniel; Bueler, Edward (2006)
      Analysis of stability for delay differential equations (DDEs) is a tool in a variety of fields such as nonlinear dynamics in physics, biology, and chemistry, engineering and pure mathematics. Stability analysis is based primarily on the eigenvalues of a discretized system. Situations exist in which practical and numerical results may not match expected stability inferred from such approaches. The reasons and mechanisms for this behavior can be related to the eigenvectors associated with the eigenvalues. When the operator associated to a linear (or linearized) DDE is significantly non-normal, the stability analysis must be adapted as demonstrated here. Example DDEs are shown to have solutions which exhibit transient growth not accounted for by eigenvalues alone. Pseudospectra are computed and related to transient growth.
    • Numerical realization of the generalized Carrier-Greenspan Transform for the shallow water wave equations

      Harris, Matthew W.; Rybkin, Alexei; Williams, Gordon; Nikolsky, Dmitry (2015-08)
      We study the development of two numerical algorithms for long nonlinear wave runup that utilize the generalized Carrier-Greenspan transform. The Carrier-Greenspan transform is a hodograph transform that allows the Shallow Water Wave equations to be transformed into a linear second order wave equation with nonconstant coefficients. In both numerical algorithms the transform is numerically implemented, the resulting linear system is numerically solved and then the inverse transformation is implemented. The first method we develop is based on an implicit finite difference method and is applicable to constantly sloping bays of arbitrary cross-section. The resulting scheme is extremely fast and shows promise as a fast tsunami runup solver for wave runup in coastal fjords and narrow inlets. For the second scheme, we develop an initial value boundary problem corresponding to an Inclined bay with U or V shaped cross-sections that has a wall some distance from the shore. A spectral method is applied to the resulting linear equation in order to and a series solution. Both methods are verified against an analytical solution in an inclined parabolic bay with positive results and the first scheme is compared to the 3D numerical solver FUNWAVE with positive results.
    • On the Klein-Gordon equation originating on a curve and applications to the tsunami run-up problem

      Gaines, Jody; Rybkin, Alexei; Bueler, Ed; Nicolsky, Dmitry (2019-05)
      Our goal is to study the linear Klein-Gordon equation in matrix form, with initial conditions originating on a curve. This equation has applications to the Cross-Sectionally Averaged Shallow Water equations, i.e. a system of nonlinear partial differential equations used for modeling tsunami waves within narrow bays, because the general Carrier-Greenspan transform can turn the Cross-Sectionally Averaged Shallow Water equations (for shorelines of constant slope) into a particular form of the matrix Klein-Gordon equation. Thus the matrix Klein-Gordon equation governs the run-up of tsunami waves along shorelines of constant slope. If the narrow bay is U-shaped, the Cross-Sectionally Averaged Shallow Water equations have a known general solution via solving the transformed matrix Klein-Gordon equation. However, the initial conditions for our Klein-Gordon equation are given on a curve. Thus our goal is to solve the matrix Klein-Gordon equation with known conditions given along a curve. Therefore we present a method to extrapolate values on a line from conditions on a curve, via the Taylor formula. Finally, to apply our solution to the Cross-Sectionally Averaged Shallow Water equations, our numerical simulations demonstrate how Gaussian and N-wave profiles affect the run-up of tsunami waves within various U-shaped bays.
    • Phylogenetic trees and Euclidean embeddings

      Layer, Mark; Rhodes, John; Allman, Elizabeth; Faudree, Jill (2014-05)
      In this thesis we develop an intuitive process of encoding any phylogenetic tree and its associated tree-distance matrix as a collection of points in Euclidean space. Using this encoding, we find that information about the structure of the tree can easily be recovered by applying the inner product operation to vector combinations of the Euclidean points. By applying Classical Scaling to the tree-distance matrix, we are able to find the Euclidean points even when the phylogenetic tree is not known. We use the insight gained by encoding the tree as a collection of Euclidean points to modify the Neighbor Joining Algorithm, a method to recover an unknown phylogenetic tree from its tree-distance matrix, to be more resistant to tree-distance proportional errors.
    • Species network inference under the multispecies coalescent model

      Baños Cervantes, Hector Daniel; Allman, Elizabeth S.; Rhodes, John A.; Barry, Ronald; Faudree, Jill (2019-05)
      Species network inference is a challenging problem in phylogenetics. In this work, we present two results on this. The first shows that many topological features of a level-1 network are identifable under the network multispecies coalescent model (NMSC). Specifcally, we show that one can identify from gene tree frequencies the unrooted semidirected species network, after suppressing all cycles of size less than 4. The second presents the theory behind a new, statistically consistent, practical method for the inference of level-1 networks under the NMSC. The input for this algorithm is a collection of unrooted topological gene trees, and the output is an unrooted semidirected species network.
    • A study of saturation number

      Burr, Erika; Faudree, Jill; Williams, Gordon; Berman-Williams, Leah (2017-08)
      This paper seeks to provide complete proofs in modern notation of (early) key saturation number results and give some new results concerning the semi-saturation number. We highlight relevant results from extremal theory and present the saturation number for the complete graph Kk; and the star K₁,t, elaborating on the proofs provided in the 1964 paper A Problem in Graph Theory by Erdos, Hajnal and Moon and the 1986 paper Saturated Graphs with Minimal Number of Edges by Kászonyi and Tuza. We discuss the proof of a general bound on the saturation number for a family of target graphs provided by Kászonyi and Tuza. A discussion of related results showing that the complete graph has the maximum saturation number among target graphs of the same order and that the star has the maximum saturation number among target trees of the same order is included. Before presenting our result concerning the semi-saturation number for the path Pk; we discuss the structure of some Pk-saturated trees of large order as well as the saturation number of Pk with respect to host graphs of large order.
    • The linear algebra of interpolation with finite applications giving computational methods for multivariate polynomials

      Olmsted, Coert D.; Gislason, Gary A.; Lambert, J. P.; Lando, C. A.; Olson, J. V.; Piacenca, R. J. (1988)
      Linear representation and the duality of the biorthonormality relationship express the linear algebra of interpolation by way of the evaluation mapping. In the finite case the standard bases relate the maps to Gramian matrices. Five equivalent conditions on these objects are found which characterize the solution of the interpolation problem. This algebra succinctly describes the solution space of ordinary linear initial value problems. Multivariate polynomial spaces and multidimensional node sets are described by multi-index sets. Geometric considerations of normalization and dimensionality lead to cardinal bases for Lagrange interpolation on regular node sets. More general Hermite functional sets can also be solved by generalized Newton methods using geometry and multi-indices. Extended to countably infinite spaces, the method calls upon theorems of modern analysis.
    • Tsunami runup in U and V shaped bays

      Garayshin, Viacheslav Valer'evich; Гарайшин, Вячеслав Валерьевич; Rybkin, Alexei; Rhodes, John; Nicolsky, Dmitry (2013-08)
      Tsunami runup can be effectively modeled using the shallow water wave equations. In 1958 Carrier and Greenspan in their work "Water waves of finite amplitude on a sloping beach" used this system to model tsunami runup on a uniformly sloping plane beach. They linearized this problem using a hodograph type transformation and obtained the Klein-Gordon equation which could be explicitly solved by using the Fourier-Bessel transform. In 2011, Efim Pelinovsky and Ira Didenkulova in their work "Runup of Tsunami Waves in U-Shaped Bays" used a similar hodograph type transformation and linearized the tsunami problem for a sloping bay with parabolic cross-section. They solved the linear system by using the D'Alembert formula. This method was generalized to sloping bays with cross-sections parameterized by power functions. However, an explicit solution was obtained only for the case of a bay with a quadratic cross-section. In this paper we will show that the Klein-Gordon equation can be solved by a spectral method for any inclined bathymetry with power function for any positive power. The result can be used to estimate tsunami runup in such bays with minimal numerical computations. This fact is very important because in many cases our numerical model can be substituted for fullscale numerical models which are computationally expensive, and time consuming, and not feasible to investigate tsunami behavior in the Alaskan coastal zone, due to the low population density in this area