• Title/Summary/Keyword: Gauss equation

Search Result 122, Processing Time 0.026 seconds

ISOMETRIC IMMERSIONS OF FINSLER MANIFOLDS

  • Lee, Nany;Won, Dae Yeon
    • Korean Journal of Mathematics
    • /
    • v.17 no.1
    • /
    • pp.1-13
    • /
    • 2009
  • For an isometric immersion $f:M{\rightarrow}{\bar{M}}$ of Finsler manifolds M into $\bar{M}$, we compare the intrinsic Chern connection on M and the induced connection on M: We find the conditions for them to coincide and generalize the equations of Gauss, Ricci and Codazzi to Finsler submanifolds. In case the ambient space is a locally Minkowskian Finsler manifold, we simplify the above equations.

  • PDF

SURFACES IN $\mathbb{E}^3$ WITH L1-POINTWISE 1-TYPE GAUSS MAP

  • Kim, Young Ho;Turgay, Nurettin Cenk
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.3
    • /
    • pp.935-949
    • /
    • 2013
  • In this paper, we study surfaces in $\mathb{E}^3$ whose Gauss map G satisfies the equation ${\Box}G=f(G+C)$ for a smooth function $f$ and a constant vector C, where ${\Box}$ stands for the Cheng-Yau operator. We focus on surfaces with constant Gaussian curvature, constant mean curvature and constant principal curvature with such a property. We obtain some classification and characterization theorems for these kinds of surfaces. Finally, we give a characterization of surfaces whose Gauss map G satisfies the equation ${\Box}G={\lambda}(G+C)$ for a constant ${\lambda}$ and a constant vector C.

SURFACES OF REVOLUTION WITH POINTWISE 1-TYPE GAUSS MAP IN PSEUDO-GALILEAN SPACE

  • Choi, Miekyung;Yoon, Dae Won
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.2
    • /
    • pp.519-530
    • /
    • 2016
  • In this paper, we study surfaces of revolution in the three dimensional pseudo-Galilean space. We classify surfaces of revolution generated by a non-isotropic curve in terms of the Gauss map and the Laplacian of the surface. Furthermore, we give the classification of surfaces of revolution generated by an isotropic curve satisfying pointwise 1-type Gauss map equation.

CLASSIFICATIONS OF ROTATION SURFACES IN PSEUDO-EUCLIDEAN SPACE

  • Kim, Young-Ho;Yoon, Dae-Won
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.2
    • /
    • pp.379-396
    • /
    • 2004
  • In this article, we study rotation surfaces in the 4-dimensional pseudo-Euclidean space E$_2$$^4$. Also, we obtain the complete classification theorems for the flat rotation surfaces with finite type Gauss map, pointwise 1-type Gauss map and an equation in terms of the mean curvature vector. In fact, we characterize the flat rotation surfaces of finite type immersion with the Gauss map and the mean curvature vector field, namely the Gauss map of finite type, pointwise 1-type Gauss map and some algebraic equations in terms of the Gauss map and the mean curvature vector field related to the Laplacian of the surfaces with respect to the induced metric.

Spreading of a Lorentz-Gauss Vortex Beam Propagating through Oceanic Turbulence

  • Liu, Dajun;Yin, Hongming;Wang, Guiqiu;Wang, Yaochuan
    • Current Optics and Photonics
    • /
    • v.3 no.2
    • /
    • pp.97-104
    • /
    • 2019
  • Based on the extended Huygens-Fresnel principle, the analytical equation for a Lorentz-Gauss vortex beam propagating through oceanic turbulence has been derived. The spreading properties of a Lorentz-Gauss vortex beam propagating through oceanic turbulence are analyzed in detail using numerical examples. The results show that a Lorentz-Gauss vortex beam propagating through stronger oceanic turbulence will spread more rapidly, and the Lorentz-Gauss vortex beam with higher topological charge M will lose its initial dark center more slowly.

Analysis of Herringbone Grooved Journal Bearing Using Generalized Coordinate Transformation (일반좌표계 변환을 이용한 헤링본 그루브 베어링의 해석)

  • 박상신;한동철
    • Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.317-324
    • /
    • 1999
  • The present work is an attempt to calculate the steady state pressure and perturbed pressure of herringbone grooved journal bearings. A generalized coordinate system is introduced to handle the complex bearing geometry. The coordinates are fitted to the groove boundary and the Reynold's equation is transformed to be fitted to this coordinates system using the Gauss divergence theorem. This method makes it possible to deal with an arbitrary configuration of a lubricated surface. The characteristics of finite herringbone grooved journal are well calculated using this method.

  • PDF

Analysis of Herringbone Grooved Journal Bearing Using Generalized Coordinate Transformation (일반좌표계 변환을 이용한 헤링본 그루브 베어링의 해석)

  • 박상신;김영진;유송민
    • Tribology and Lubricants
    • /
    • v.16 no.6
    • /
    • pp.432-439
    • /
    • 2000
  • The present work is an attempt to calculate the steady state pressure and perturbed pressure of herringbone grooved journal bearings. A generalized coordinate system is introduced to handle the complex bearing geometry. The coordinates are fitted to the groove boundary and the Reynold's equation is transformed to be fitted to this coordinate system using the Gauss divergence theorem. This method makes it possible to deal with an arbitrary configuration of a lubricated surface. The caharacteristics of finite herringbone groove journal bearing are well calculated using this method.

A CELL BOUNDARY ELEMENT METHOD FOR A FLUX CONTROL PROBLEM

  • Jeon, Youngmok;Lee, Hyung-Chun
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.1
    • /
    • pp.81-93
    • /
    • 2013
  • We consider a distributed optimal flux control problem: finding the potential of which gradient approximates the target vector field under an elliptic constraint. Introducing the Lagrange multiplier and a change of variables the Euler-Lagrange equation turns into a coupled equation of an elliptic equation and a reaction diffusion equation. The change of variables reduces iteration steps dramatically when the Gauss-Seidel iteration is considered as a solution method. For the elliptic equation solver we consider the Cell Boundary Element (CBE) method, which is the finite element type flux preserving methods.

ON THE SEMILOCAL CONVERGENCE OF THE GAUSS-NEWTON METHOD USING RECURRENT FUNCTIONS

  • Argyros, Ioannis K.;Hilout, Said
    • The Pure and Applied Mathematics
    • /
    • v.17 no.4
    • /
    • pp.307-319
    • /
    • 2010
  • We provide a new semilocal convergence analysis of the Gauss-Newton method (GNM) for solving nonlinear equation in the Euclidean space. Using our new idea of recurrent functions, and a combination of center-Lipschitz, Lipschitz conditions, we provide under the same or weaker hypotheses than before [7]-[13], a tighter convergence analysis. The results can be extented in case outer or generalized inverses are used. Numerical examples are also provided to show that our results apply, where others fail [7]-[13].

Accelerating Numerical Analysis of Reynolds Equation Using Graphic Processing Units (그래픽처리장치를 이용한 레이놀즈 방정식의 수치 해석 가속화)

  • Myung, Hun-Joo;Kang, Ji-Hoon;Oh, Kwang-Jin
    • Tribology and Lubricants
    • /
    • v.28 no.4
    • /
    • pp.160-166
    • /
    • 2012
  • This paper presents a Reynolds equation solver for hydrostatic gas bearings, implemented to run on graphics processing units (GPUs). The original analysis code for the central processing unit (CPU) was modified for the GPU by using the compute unified device architecture (CUDA). The red-black Gauss-Seidel (RBGS) algorithm was employed instead of the original Gauss-Seidel algorithm for the iterative pressure solver, because the latter has data dependency between neighboring nodes. The implemented GPU program was tested on the nVidia GTX580 system and compared to the original CPU program on the AMD Llano system. In the iterative pressure calculation, the implemented GPU program showed 20-100 times faster performance than the original CPU codes. Comparison of the wall-clock times including all of pre/post processing codes showed that the GPU codes still delivered 4-12 times faster performance than the CPU code for our target problem.