Spelling suggestions: "subject:"crinite geometries"" "subject:"cofinite geometries""
11 |
A Cartesian finite-volume method for the Euler equationsChoi, Sang Keun January 1987 (has links)
A numerical procedure has been developed for the computation of inviscid flows over arbitrary, complex two-dimensional geometries. The Euler equations are solved using a finite-volume method with a non-body-fitted Cartesian grid. A new numerical formulation for complicated body geometries is developed in conjunction with implicit flux-splitting schemes. A variety of numerical computations have been performed to validate the numerical methodologies developed. Computations for supersonic flow over a flat plate with an impinging shock wave are used to verify the numerical algorithm, without geometric considerations. The supersonic flow over a blunt body is utilized to show the accuracy of the non-body-fitted Cartesian grid, along with the shock resolution of flux-vector splitting scheme. Geometric complexities are illustrated with the flow through a two-dimensional supersonic inlet with and without an open bleed door. The ability of the method to deal with subsonic and transonic flows is illustrated by computations over a non-lifting NACA 0012 airfoil. The method is shown to be accurate, efficient and robust and should prove to be particularly useful in a preliminary design mode, where flows past a wide variety of complex geometries can be computed without complicated grid generation procedures. / Ph. D. Read more
|
12 |
Construction of combinatorial designs with prescribed automorphism groupsUnknown Date (has links)
In this dissertation, we study some open problems concerning the existence or non-existence of some combinatorial designs. We give the construction or proof of non-existence of some Steiner systems, large sets of designs, and graph designs, with prescribed automorphism groups. / by Emre Kolotoæglu. / Thesis (Ph.D.)--Florida Atlantic University, 2013. / Includes bibliography. / Mode of access: World Wide Web. / System requirements: Adobe Reader.
|
13 |
Low rank transitive representations, primitive extensions, and the collision problem in PSL (2, q)Unknown Date (has links)
Every transitive permutation representation of a finite group is the representation of the group in its action on the cosets of a particular subgroup of the group. The group has a certain rank for each of these representations. We first find almost all rank-3 and rank-4 transitive representations of the projective special linear group P SL(2, q) where q = pm and p is an odd prime. We also determine the rank of P SL (2, p) in terms of p on the cosets of particular given subgroups. We then investigate the construction of rank-3 transitive and primitive extensions of a simple group, such that the extension group formed is also simple. In the latter context we present a new, group theoretic construction of the famous Hoffman-Singleton graph as a rank-3 graph. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2015 / FAU Electronic Theses and Dissertations Collection
|
Page generated in 0.0579 seconds