Many methods of passive flow control rely on changes to surface morphology. Roughening surfaces to induce boundary layer transition to turbulence and in turn delay separation is a powerful approach to lowering drag on bluff bodies. While the influence in broad terms of how roughness and other means of passive flow control to delay separation on bluff bodies is known, basic mechanisms are not well understood. Of particular interest for the current work is understanding the role of surface dimpling on boundary layers. A computational approach is employed and the study has two main goals. The first is to understand and advance the numerical methodology utilized for the computations. The second is to shed some light on the details of how surface dimples distort boundary layers and cause transition to turbulence. Simulations are performed of the flow over a simplified configuration: the flow of a boundary layer over a dimpled flat plate. The flow is modeled using an immersed boundary as a representation of the dimpled surface along with direct numerical simulation of the Navier-Stokes equations. The dimple geometry used is fixed and is that of a spherical depression in the flat plate with a depth-to-diameter ratio of 0.1. The dimples are arranged in staggered rows separated by spacing of the center of the bottom of the dimples by one diameter in both the spanwise and streamwise dimensions. The simulations are conducted for both two and three staggered rows of dimples. Flow variables are normalized at the inlet by the dimple depth and the Reynolds number is specified as 4000 (based on freestream velocity and inlet boundary layer thickness). First and second order statistics show the turbulent boundary layers correlate well to channel flow and flow of a zero pressure gradient flat plate boundary layers in the viscous sublayer and the buffer layer, but deviates further away from the wall. The forcing of transition to turbulence by the dimples is unlike the transition caused by a naturally transitioning flow, a small perturbation such as trip tape in experimental flows, or noise in the inlet condition for computational flows.

The theme for this work is the development of fast numerical algorithms for sparse optimization as well as their applications in medical imaging and source localization using sensor array processing. Due to the recently proposed theory of Compressive Sensing (CS), the $\ell_1$ minimization problem attracts more attention for its ability to exploit sparsity. Traditional interior point methods encounter difficulties in computation for solving the CS applications. In the first part of this work, a fast algorithm based on the augmented Lagrangian method for solving the large-scale TV-$\ell_1$ regularized inverse problem is proposed. Specifically, by taking advantage of the separable structure, the original problem can be approximated via the sum of a series of simple functions with closed form solutions. A preconditioner for solving the block Toeplitz with Toeplitz block (BTTB) linear system is proposed to accelerate the computation. An in-depth discussion on the rate of convergence and the optimal parameter selection criteria is given. Numerical experiments are used to test the performance and the robustness of the proposed algorithm to a wide range of parameter values. Applications of the algorithm in magnetic resonance (MR) imaging and a comparison with other existing methods are included. The second part of this work is the application of the TV-$\ell_1$ model in source localization using sensor arrays. The array output is reformulated into a sparse waveform via an over-complete basis and study the $\ell_p$-norm properties in detecting the sparsity. An algorithm is proposed for minimizing a non-convex problem. According to the results of numerical experiments, the proposed algorithm with the aid of the $\ell_p$-norm can resolve closely distributed sources with higher accuracy than other existing methods.

Graph coloring is about allocating resources that can be shared except where there are certain pairwise conflicts between recipients. The simplest coloring algorithm that attempts to conserve resources is called first fit. Interval graphs are used in models for scheduling (in computer science and operations research) and in biochemistry for one-dimensional molecules such as genetic material. It is not known precisely how much waste in the worst case is due to the first-fit algorithm for coloring interval graphs. However, after decades of research the range is narrow. Kierstead proved that the performance ratio R is at most 40. Pemmaraju, Raman, and Varadarajan proved that R is at most 10. This can be improved to 8. Witsenhausen, and independently Chrobak and Slusarek, proved that R is at least 4. Slusarek improved this to 4.45. Kierstead and Trotter extended the method of Chrobak and Slusarek to one good for a lower bound of 4.99999 or so. The method relies on number sequences with a certain property of order. It is shown here that each sequence considered in the construction satisfies a linear recurrence; that R is at least 5; that the Fibonacci sequence is in some sense minimally useless for the construction; and that the Fibonacci sequence is a point of accumulation in some space for the useful sequences of the construction. Limitations of all earlier constructions are revealed.