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

Physical Sciences and Mathematics Commons

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

Articles 1 - 13 of 13

Full-Text Articles in Physical Sciences and Mathematics

Domain Decomposition Methods For The Solution Of Multiple Scattering Problems, Michael Pedneault Dec 2018

Domain Decomposition Methods For The Solution Of Multiple Scattering Problems, Michael Pedneault

Dissertations

This presents a Schur complement Domain Decomposition (DD) algorithm for the solution of frequency domain multiple scattering problems. Just as in the classical DD methods,(1) the ensemble of scatterers is enclosed in a domain bounded by an artificial boundary, (2) this domain is subdivided into a collection of nonoverlapping subdomains so that the boundaries of the subdomains do not intersect any of the scatterers, and (3) the solutions of the subproblems are connected via Robin boundary conditions matching on the common interfaces between subdomains. Subdomain Robin-to-Robin maps are used to recast the DD problem as a sparse linear system whose …


Fwer Controlling Procedures In Simultaneous And Selective Inference, Li Yu Dec 2018

Fwer Controlling Procedures In Simultaneous And Selective Inference, Li Yu

Dissertations

With increasing complexity of research objectives in clinical trials, a variety of relatively complex and less intuitive multiple testing procedures (MTPs) have been developed and applied in clinical data analysis. In order to make testing strategies more explicit and intuitive to communicate with non-statisticians, several flexible and powerful graphical approaches have recently been introduced in the literature for developing and visualizing newer MTPs. Nevertheless, some theoretical as well as methodological issues still remain to be fully addressed. This dissertation addresses several important issues arising in graphical approaches and related selective inference problems. It consists of three parts.

In the first …


Predicted Deepwater Bathymetry From Satellite Altimetry: Non-Fourier Transform Alternatives, Maxsimo Salazar Dec 2018

Predicted Deepwater Bathymetry From Satellite Altimetry: Non-Fourier Transform Alternatives, Maxsimo Salazar

Dissertations

Robert Parker (1972) demonstrated the effectiveness of Fourier Transforms (FT) to compute gravitational potential anomalies caused by uneven, non-uniform layers of material. This important calculation relates the gravitational potential anomaly to sea-floor topography. As outlined by Sandwell and Smith (1997), a six-step procedure, utilizing the FT, then demonstrated how satellite altimetry measurements of marine geoid height are inverted into seafloor topography. However, FTs are not local in space and produce Gibb’s phenomenon around discontinuities. Seafloor features exhibit spatial locality and features such as seamounts and ridges often have sharp inclines. Initial tests compared the windowed-FT to wavelets in reconstruction of …


Generalized Line Graphs, Mohra Abdullah Z. Alqahtani Dec 2018

Generalized Line Graphs, Mohra Abdullah Z. Alqahtani

Dissertations

With every nonempty graph, there are associated many graphs. One of the best known and most studied of these is the line graph L (G) of a graph G, whose vertices are the edges of G and where two vertices of L (G) are adjacent if the corresponding edges of G are adjacent. This concept was implicitly introduced by Whitney in 1932. Over the years, characterizations of graphs that are line graphs have been given, as well as graphs whose line graphs have some specified property. For example, Beineke characterized graphs that are line graphs by forbidding certain graphs …


Probabilistic And Extremal Problems In Combinatorics, Sean English Aug 2018

Probabilistic And Extremal Problems In Combinatorics, Sean English

Dissertations

Graph theory as a mathematical branch has been studied rigorously for almost three centuries. In the past century, many new branches of graph theory have been proposed. One important branch of graph theory involves the study of extremal graph theory. In 1941, Turán studied one of the first extremal problems, namely trying to maximize the number of edges over all graphs which avoid having certain structures. Since then, a large body of work has been created in the study of similar problems. In this dissertation, a few different extremal problems are studied, but for hypergraphs rather than graphs. In particular, …


The Bellringer Sequence: Investigating What And How Preservice Mathematics Teachers Learn Through Pedagogies Of Enactment, Mary A. Ochieng Jun 2018

The Bellringer Sequence: Investigating What And How Preservice Mathematics Teachers Learn Through Pedagogies Of Enactment, Mary A. Ochieng

Dissertations

This study examines preservice teacher learning through pedagogies of enactment—approaches to teacher education that allow preservice teachers to learn by doing what teachers do. Preservice teacher (PST) learning is examined through the implementation of the Bellringer Sequence (BRS), a pedagogy of enactment conceptualized in the study. The BRS is centered around bellringers—brief mathematical tasks implemented as students arrive for class. The BRS is a sequence of four activities centered on a bellringer: preparation (for teaching a bellringer) implementation (of the bellringer with peers), debriefing (discussing the implementation as colleagues), and written reflection (about the effectiveness of the bellringer).

Practice-based approaches …


Induced Graph Colorings, Ian Hart Jun 2018

Induced Graph Colorings, Ian Hart

Dissertations

An edge coloring of a nonempty graph G is an assignment of colors to the edges of G. In an unrestricted edge coloring, adjacent edges of G may be colored the same. If every two adjacent edges of G are colored differently, then this edge coloring is proper and the minimum number of colors in a proper edge coloring of G is the chromatic index χ/(G) of G. A proper vertex coloring of a nontrivial graph G is an assignment of colors to the vertices of G such that every two adjacent vertices of …


Graceful Colorings And Connection In Graphs, Alexis D. Byers Jun 2018

Graceful Colorings And Connection In Graphs, Alexis D. Byers

Dissertations

For a graph G of size m, a graceful labeling of G is an injective function f : V (G) {0, 1, . . . , m} that gives rise to a bijective function f 1 : E(G) {1, 2, . . . , m} defined by f 1(uv) = |f (u) f (v)|. A graph is graceful if it has a graceful labeling. Over the years, a number of variations of graceful …


Survival Analysis Using Archimedean Copulas, Xieyang Jia May 2018

Survival Analysis Using Archimedean Copulas, Xieyang Jia

Dissertations

This dissertation has three independent parts. The first part studies a variation of the competing risks problem, known as the semi-competing risks problem, in which a terminal event censors a non-terminal event, but not vice versa, in the presence of a censoring event which is independent of these two events. The joint distribution of the two dependent events is formulated under Archimedean copula. An estimator for the association parameter of the copula is proposed, which is shown to be consistent. Simulation shows that the method works well with most common Archimedean copula models.

The second part studies the properties of …


Numerical Simulations Of Thin Viscoelastic Films, Valeria Barra May 2018

Numerical Simulations Of Thin Viscoelastic Films, Valeria Barra

Dissertations

This dissertation is developed in the field of Computational Fluid Dynamics (CFD) and it focuses on numerical simulations of the dynamics of thin viscoelastic films in different settings. The first part of this dissertation presents a novel computational investigation of thin viscoelastic films and drops, that are subject to the van der Waals interaction force, in two spatial dimensions. The liquid films are deposited on a flat solid substrate, that can have a zero or nonzero inclination with respect to the base. The equation that governs the interfacial dynamics of the thin films and drops is obtained within the long-wave …


Instabilities In Nematic Liquid Crystal Films And Droplets, Michael-Angelo Y.-H. Lam May 2018

Instabilities In Nematic Liquid Crystal Films And Droplets, Michael-Angelo Y.-H. Lam

Dissertations

The dynamics of thin films of nematic liquid crystal (NLC) are studied. Nematic liquid crystals are a type of non-Newtonian fluid with anisotropic viscous effects (due to the shape of the molecules) and elasticity effects (due to interacting electrical dipole moments). Exploiting the small aspect ratio in the geometry of interest, a fourth-order non-linear partial differential equation is used to model the free surface of the thin films. Particular attention is paid to the interplay between the bulk elasticity and the preferred orientation (boundary condition) of NLC molecules at the two interfaces: the substrate and the free surface. This work …


Rapid Generation Of Jacobi Matrices For Measures Modified By Rational Factors, Amber Sumner May 2018

Rapid Generation Of Jacobi Matrices For Measures Modified By Rational Factors, Amber Sumner

Dissertations

Orthogonal polynomials are important throughout the fields of numerical analysis and numerical linear algebra. The Jacobi matrix J for a family of n orthogonal polynomials is an n x n tridiagonal symmetric matrix constructed from the recursion coefficients for the three-term recurrence satisfied by the family. Every family of polynomials orthogonal with respect to a measure on a real interval [a,b] satisfies such a recurrence. Given a measure that is modified by multiplying by a rational weight function r(t), an important problem is to compute the modified Jacobi matrix Jmod corresponding to the new measure from knowledge of J. There …


Edge Induced Weightings Of Uniform Hypergraphs And Related Problems, Laars C. Helenius Apr 2018

Edge Induced Weightings Of Uniform Hypergraphs And Related Problems, Laars C. Helenius

Dissertations

The starting point of the research is the so called 1-2-3 Conjecture formulated in 2004 by Karoński, Luczak, and Thomason. Roughly speaking it says that the edges of any graph can be weighted from {1, 2, 3} so that the induced vertex coloring (as the sum of weights adjacent to a given vertex) is proper. The conjecture has attracted a lot of interest from researchers over the last decade but is still unanswered. More recently, the conjecture has been studied for hypergraphs.

The main result of this dissertation shows in particular that an analogous conjecture holds for almost all uniform …