• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 11
  • 11
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Diffraction by doubly curved convex surfaces /

Voltmer, David Russell January 1970 (has links)
No description available.
2

Legendrian knot and some classification problems in standard contact S3.

January 2004 (has links)
Ku Wah Kwan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 61-64). / Abstracts in English and Chinese. / Chapter 1 --- Basic 3-Dimensional Contact Geometry --- p.5 / Chapter 1.1 --- Introduction --- p.5 / Chapter 1.2 --- Contact Structure --- p.7 / Chapter 1.3 --- Darboux's Theorem --- p.11 / Chapter 1.4 --- Characteristic Foliation --- p.13 / Chapter 1.5 --- More About S3 with The Standard Contact Structure --- p.16 / Chapter 2 --- Legendrian Knots --- p.18 / Chapter 2.1 --- Basic Definition --- p.18 / Chapter 2.2 --- Front Projection --- p.19 / Chapter 2.3 --- Classical Legendrian Knot Invariants --- p.22 / Chapter 2.3.1 --- Thurston-Bennequin Invariant --- p.22 / Chapter 2.3.2 --- Rotation Number --- p.23 / Chapter 2.4 --- Stabilization --- p.24 / Chapter 3 --- Convex Surface Theory --- p.26 / Chapter 3.1 --- Contact Vector Field --- p.26 / Chapter 3.2 --- Convex Surfaces --- p.29 / Chapter 3.3 --- Flexibility of Characteristic Foliation --- p.34 / Chapter 3.4 --- Bennequin Inequality --- p.36 / Chapter 3.5 --- Bypass --- p.38 / Chapter 3.5.1 --- Modification of Dividing Curves through Bypass --- p.39 / Chapter 3.5.2 --- Relation of Bypass and Stabilizing Disk --- p.40 / Chapter 3.5.3 --- Finding Bypass --- p.40 / Chapter 3.6 --- Tight Contact Structures on Solid Tori --- p.41 / Chapter 4 --- Classification Results --- p.42 / Chapter 4.1 --- Unknot --- p.43 / Chapter 4.2 --- Positive Torus Knot --- p.45 / Chapter 5 --- Transverse Knots --- p.50 / Chapter 5.1 --- Basic Definition --- p.50 / Chapter 5.2 --- Self-linking Number --- p.54 / Chapter 5.3 --- Relation between Transverse Knot and Legendrian Knot --- p.55 / Chapter 5.4 --- Classification of Unknot and Torus Knot --- p.57 / Chapter 6 --- Recent Development --- p.60 / Bibliography --- p.61
3

On the reachability region of a ladder in two convex polygons

Mansouri, Minou. January 1986 (has links)
No description available.
4

On the reachability region of a ladder in two convex polygons

Mansouri, Minou. January 1986 (has links)
No description available.
5

A numerical approach to Tamme's problem in euclidean n-space

Adams, Patrick Guy 09 June 1997 (has links)
Graduation date: 1998
6

End-wall flow of a surface-mounted obstacle on a convex hump

Ahmed, Hamza Hafez. Ahmed, Anwar, January 2009 (has links)
Thesis--Auburn University, 2009. / Abstract. Includes bibliographic references (p.70-72).
7

The numerical approximation of surface area by surface triangulation /

Malek, Alaeddin. January 1986 (has links)
No description available.
8

The numerical approximation of surface area by surface triangulation /

Malek, Alaeddin. January 1986 (has links)
No description available.
9

Convexity-Preserving Scattered Data Interpolation

Leung, Nim Keung 12 1900 (has links)
Surface fitting methods play an important role in many scientific fields as well as in computer aided geometric design. The problem treated here is that of constructing a smooth surface that interpolates data values associated with scattered nodes in the plane. The data is said to be convex if there exists a convex interpolant. The problem of convexity-preserving interpolation is to determine if the data is convex, and construct a convex interpolant if it exists.
10

Steepest Sescent on a Uniformly Convex Space

Zahran, Mohamad M. 08 1900 (has links)
This paper contains four main ideas. First, it shows global existence for the steepest descent in the uniformly convex setting. Secondly, it shows existence of critical points for convex functions defined on uniformly convex spaces. Thirdly, it shows an isomorphism between the dual space of H^{1,p}[0,1] and the space H^{1,q}[0,1] where p > 2 and {1/p} + {1/q} = 1. Fourthly, it shows how the Beurling-Denny theorem can be extended to find a useful function from H^{1,p}[0,1] to L_{p}[1,0] where p > 2 and addresses the problem of using that function to establish a relationship between the ordinary and the Sobolev gradients. The paper contains some numerical experiments and two computer codes.

Page generated in 0.0567 seconds