Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Uncertainty Assessment For Cfd Using Error Transport Equation, Gusheng Hu
Uncertainty Assessment For Cfd Using Error Transport Equation, Gusheng Hu
Graduate Theses, Dissertations, and Problem Reports
While Computational Fluid Dynamics (CFD) is making extensive use of the power of computational technology, it is also facing a serious problem arising from the so-called numerical uncertainty. The overall uncertainty (or the global error) involved in CFD results can be due to different sources mainly contributed by (i) discretization error (or solution error due to incomplete grid convergence), (ii) iteration convergence error, (iii) grid generation errors (skewness, grid aspect and expansion ratio, coordinate transformation etc.), and (iv) round-off errors. In this study an in-depth discussion concerning these issues is presented with an emphasis on the discretization error in regard …
Small Cycle Cover, Group Coloring With Related Problems, Xiangwen Li
Small Cycle Cover, Group Coloring With Related Problems, Xiangwen Li
Graduate Theses, Dissertations, and Problem Reports
Bondy conjectured that if G is a simple 2-connected graph with n ≥ 3 vertices, then the edges of G can be covered by at most 2n-33 cycles. In Chapter 2, a result on small cycle cover is obtained and we also show that the result is as best as possible.;Thomassen conjectured that every 4-connected line graph is hamiltonian. In Chapters 3 and 4, we apply Catlin's reduction method to study cycles in line graphs. Results about hamiltonian connectivity of line graphs and 3-edge-connected graphs are obtained. Several former results are extended.;Jaeger, Linial, Payan and Tarsi introduced group coloring in …
Whitney Preserving Maps, Benjamin Espinoza
Whitney Preserving Maps, Benjamin Espinoza
Graduate Theses, Dissertations, and Problem Reports
We connect Whitney levels and continuous functions between continua to obtain the new notion of Whitney preserving maps. We introduce the basic properties of Whitney preserving maps. We give conditions on a continuum X in order that a Whitney preserving map f from X to the unit interval is a homeomorphism, and we give examples to show the conditions are necessary and that the result is false when the range of the map is the unit circle. Concerning the structure of any continuum X, we show that if A is a continuous decomposition of X into nondegenerate terminal continua, then …
Chebyshev Pseudospectral Methods For Conservation Laws With Source Terms And Applications To Multiphase Flow, Scott Alan Sarra
Chebyshev Pseudospectral Methods For Conservation Laws With Source Terms And Applications To Multiphase Flow, Scott Alan Sarra
Graduate Theses, Dissertations, and Problem Reports
Pseudospectral methods are well known to produce superior results for the solution of partial differential equations whose solutions have a certain amount of regularity. Recent advances have made possible the use of spectral methods for the solution of conservation laws whose solutions may contain shocks. We use a recently described Super Spectral Viscosity method to obtain stable approximations of Systems of Nonlinear Hyperbolic Conservation Laws. A recently developed postprocessing method, which is theoretically capable of completely removing the Gibbs phenomenon from the Super Spectral Viscosity approximation, is examined. The postprocessing method has shown great promise when applied in some simple …
Edge Coloring Of Simple Graphs And Edge -Face Coloring Of Simple Plane Graphs, Rong Luo
Edge Coloring Of Simple Graphs And Edge -Face Coloring Of Simple Plane Graphs, Rong Luo
Graduate Theses, Dissertations, and Problem Reports
We prove that chie( G) = Delta if Delta ≥ 5 and g ≥ 4, or Delta ≥ 4 and g ≥ 5, or Delta ≥ 3 and g ≥ 9. In addition, if chi(Sigma) > 0, then chie( G) = Delta if Delta ≥ 3 and g ≥ 8 where Delta, g is the maximum degree, the girth of the graph G, respectively.;It is proved that G is not critical if d¯ ≤ 6 and Delta ≥ 8, or d¯ ≤ 203 and Delta ≥ 9. This result generalizes earlier results.;Given a simple plane graph G, an edge-face k-coloring of …