546 research outputs found
Doctor of Philosophy
dissertationWhile boundary representations, such as nonuniform rational B-spline (NURBS) surfaces, have traditionally well served the needs of the modeling community, they have not seen widespread adoption among the wider engineering discipline. There is a common perception that NURBS are slow to evaluate and complex to implement. Whereas computer-aided design commonly deals with surfaces, the engineering community must deal with materials that have thickness. Traditional visualization techniques have avoided NURBS, and there has been little cross-talk between the rich spline approximation community and the larger engineering field. Recently there has been a strong desire to marry the modeling and analysis phases of the iterative design cycle, be it in car design, turbulent flow simulation around an airfoil, or lighting design. Research has demonstrated that employing a single representation throughout the cycle has key advantages. Furthermore, novel manufacturing techniques employing heterogeneous materials require the introduction of volumetric modeling representations. There is little question that fields such as scientific visualization and mechanical engineering could benefit from the powerful approximation properties of splines. In this dissertation, we remove several hurdles to the application of NURBS to problems in engineering and demonstrate how their unique properties can be leveraged to solve problems of interest
Computing all maps into a sphere
Given topological spaces X and Y, a fundamental problem of algebraic topology
is understanding the structure of all continuous maps X -> Y . We consider a
computational version, where X, Y are given as finite simplicial complexes, and
the goal is to compute [X,Y], i.e., all homotopy classes of such maps. We solve
this problem in the stable range, where for some d >= 2, we have dim X <= 2d -
2 and Y is (d - 1)-connected; in particular, Y can be the d-dimensional sphere
S^d. The algorithm combines classical tools and ideas from homotopy theory
(obstruction theory, Postnikov systems, and simplicial sets) with algorithmic
tools from effective algebraic topology (locally effective simplicial sets and
objects with effective homology). In contrast, [X,Y] is known to be
uncomputable for general X,Y, since for X = S^1 it includes a well known
undecidable problem: testing triviality of the fundamental group of Y. In
follow-up papers, the algorithm is shown to run in polynomial time for d fixed,
and extended to other problems, such as the extension problem, where we are
given a subspace A of X and a map A -> Y and ask whether it extends to a map X
-> Y, or computing the Z_2-index---everything in the stable range. Outside the
stable range, the extension problem is undecidable.Comment: 42 pages; a revised and substantially updated version (referring to
follow-up papers and results
Directed Chaotic Transport in Hamiltonian Ratchets
We present a comprehensive account of directed transport in one-dimensional
Hamiltonian systems with spatial and temporal periodicity. They can be
considered as Hamiltonian ratchets in the sense that ensembles of particles can
show directed ballistic transport in the absence of an average force. We
discuss general conditions for such directed transport, like a mixed classical
phase space, and elucidate a sum rule that relates the contributions of
different phase-space components to transport with each other. We show that
regular ratchet transport can be directed against an external potential
gradient while chaotic ballistic transport is restricted to unbiased systems.
For quantized Hamiltonian ratchets we study transport in terms of the evolution
of wave packets and derive a semiclassical expression for the distribution of
level velocities which encode the quantum transport in the Floquet band
spectra. We discuss the role of dynamical tunneling between transporting
islands and the chaotic sea and the breakdown of transport in quantum ratchets
with broken spatial periodicity.Comment: 22 page
Feasible Form Parameter Design of Complex Ship Hull Form Geometry
This thesis introduces a new methodology for robust form parameter design of complex hull form geometry via constraint programming, automatic differentiation, interval arithmetic, and truncated hierarchical B- splines. To date, there has been no clearly stated methodology for assuring consistency of general (equality and inequality) constraints across an entire geometric form parameter ship hull design space. In contrast, the method to be given here can be used to produce guaranteed narrowing of the design space, such that infeasible portions are eliminated. Furthermore, we can guarantee that any set of form parameters generated by our method will be self consistent. It is for this reason that we use the title feasible form parameter design.
In form parameter design, a design space is represented by a tuple of design parameters which are extended in each design space dimension. In this representation, a single feasible design is a consistent set of real valued parameters, one for every component of the design space tuple. Using the methodology to be given here, we pick out designs which consist of consistent parameters, narrowed to any desired precision up to that of the machine, even for equality constraints. Furthermore, the method is developed to enable the generation of complex hull forms using an extension of the basic rules idea to allow for automated generation of rules networks, plus the use of the truncated hierarchical B-splines, a wavelet-adaptive extension of standard B-splines and hierarchical B-splines. The adaptive resolution methods are employed in order to allow an automated program the freedom to generate complex B-spline representations of the geometry in a robust manner across multiple levels of detail. Thus two complementary objectives are pursued: ensuring feasible starting sets of form parameters, and enabling the generation of complex hull form geometry
- …