• 제목/요약/키워드: orthogonal metric space

검색결과 10건 처리시간 0.02초

APPLICATION AND FIXED POINT THEOREMS FOR ORTHOGONAL GENERALIZED F-CONTRACTION MAPPINGS ON O-COMPLETE METRIC SPACE

  • Mani, Gunaseelan;Prakasam, A. Leema Maria;Mishra, Lakshmi Narayan;Mishra, Vishnu Narayan
    • Nonlinear Functional Analysis and Applications
    • /
    • 제26권5호
    • /
    • pp.903-915
    • /
    • 2021
  • In this paper, we introduce the concepts of an orthogonal generalized F-contraction mapping and prove some fixed point theorems for a self mapping in an orthogonal metric space. The given results are generalization and extension some of the well-known results in the literature. An example to support our result is presented.

COMMON FIXED POINT RESULTS FOR GENERALIZED ORTHOGONAL F-SUZUKI CONTRACTION FOR FAMILY OF MULTIVALUED MAPPINGS IN ORTHOGONAL b-METRIC SPACES

  • Leyew, Bahru Tsegaye;Mewomo, Oluwatosin Temitope
    • 대한수학회논문집
    • /
    • 제37권4호
    • /
    • pp.1147-1170
    • /
    • 2022
  • In this paper, we introduce a new class of mappings called the generalized orthogonal F-Suzuki contraction for a family of multivalued mappings in the setup of orthogonal b-metric spaces. We established the existence of some common fixed point results without using any commutativity condition for this new class of mappings in orthogonal b-metric spaces. Moreover, we illustrate and support these common fixed point results with example. The results obtained in this work generalize and extend some recent and classical related results in the existing literature.

METRIC FOLIATIONS ON HYPERBOLIC SPACES

  • Lee, Kyung-Bai;Yi, Seung-Hun
    • 대한수학회지
    • /
    • 제48권1호
    • /
    • pp.63-82
    • /
    • 2011
  • On the hyperbolic space $D^n$, codimension-one totally geodesic foliations of class $C^k$ are classified. Except for the unique parabolic homogeneous foliation, the set of all such foliations is in one-one correspondence (up to isometry) with the set of all functions z : [0, $\pi$] $\rightarrow$ $S^{n-1}$ of class $C^{k-1}$ with z(0) = $e_1$ = z($\pi$) satisfying |z'(r)| ${\leq}1$ for all r, modulo an isometric action by O(n-1) ${\times}\mathbb{R}{\times}\mathbb{Z}_2$. Since 1-dimensional metric foliations on $D^n$ are always either homogeneous or flat (that is, their orthogonal distributions are integrable), this classifies all 1-dimensional metric foliations as well. Equations of leaves for a non-trivial family of metric foliations on $D^2$ (called "fifth-line") are found.

Function space formulation of the 3-noded distorted Timoshenko metric beam element

  • Manju, S.;Mukherjee, Somenath
    • Structural Engineering and Mechanics
    • /
    • 제69권6호
    • /
    • pp.615-626
    • /
    • 2019
  • The 3-noded metric Timoshenko beam element with an offset of the internal node from the element centre is used here to demonstrate the best-fit paradigm using function space formulation under locking and mesh distortion. The best-fit paradigm follows from the projection theorem describing finite element analysis which shows that the stresses computed by the displacement finite element procedure are the best approximation of the true stresses at an element level as well as global level. In this paper, closed form best-fit solutions are arrived for the 3-noded Timoshenko beam element through function space formulation by combining field consistency requirements and distortion effects for the element modelled in metric Cartesian coordinates. It is demonstrated through projection theorems how lock-free best-fit solutions are arrived even under mesh distortion by using a consistent definition for the shear strain field. It is shown how the field consistency enforced finite element solution differ from the best-fit solution by an extraneous response resulting from an additional spurious force vector. However, it can be observed that when the extraneous forces vanish fortuitously, the field consistent solution coincides with the best-fit strain solution.

An improved parametric formulation for the variationally correct distortion immune three-noded bar element

  • Mukherjee, Somenath;Manju, S.
    • Structural Engineering and Mechanics
    • /
    • 제38권3호
    • /
    • pp.261-281
    • /
    • 2011
  • A new method of formulation of a class of elements that are immune to mesh distortion effects is proposed here. The simple three-noded bar element with an offset of the internal node from the element center is employed here to demonstrate the method and the principles on which it is founded upon. Using the function space approach, the modified formulation is shown here to be superior to the conventional isoparametric version of the element since it satisfies the completeness requirement as the metric formulation, and yet it is in agreement with the best-fit paradigm in both the metric and the parametric domains. Furthermore, the element error is limited to only those that are permissible by the classical projection theorem of strains and stresses. Unlike its conventional counterpart, the modified element is thus not prone to any errors from mesh distortion. The element formulation is symmetric and thus satisfies the requirement of the conservative nature of problems associated with all self-adjoint differential operators. The present paper indicates that a proper mapping set for distortion immune elements constitutes geometric and displacement interpolations through parametric and metric shape functions respectively, with the metric components in the displacement/strain replaced by the equivalent geometric interpolation in parametric co-ordinates.

Pick-the-Winner법과 공간축소법에 기반한 플라스틱 사출성형품의 휨 최소화 (Minimization of Warpage in Plastic Injection-Molded Parts Based on the ‘Pick-the-Winner' Rule and Design Space Reduction Method)

  • 박종천;김경모;김광호
    • 한국산학기술학회논문지
    • /
    • 제11권4호
    • /
    • pp.1171-1177
    • /
    • 2010
  • 본 논문은 직교배열실험에 기반한 'Pick-the-Winner'법과 설계공간축소법에 기초하여 사출성형 제품의 휨을 잡음(noise)의 존재 하에서도 최소화할 수 있는 강건설계 절차를 제시한다. 강건설계는 현실적 요구를 반영하여 두 단계의 이원적 최적화 과정, 즉 제품 형상에 대한 강건설계와 공정조건에 대한 강건설계로 이루어진다. 제안한 강건설계 절차를 사각형 박막 제품의 설계에 적용한 결과, 본 강건설계법이 현실적 효용성이 있음을 확인하였다.

Design of nonlinear optimal regulators using lower dimensional riemannian geometric models

  • Izawa, Yoshiaki;Hakomori, Kyojiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
    • /
    • pp.628-633
    • /
    • 1994
  • A new Riemannian geometric model for the controlled plant is proposed by imbedding the control vector space in the state space, so as to reduce the dimension of the model. This geometric model is derived by replacing the orthogonal straight coordinate axes on the state space of a linear system with the curvilinear coordinate axes. Therefore the integral manifold of the geometric model becomes homeomorphic to that of fictitious linear system. For the lower dimensional Riemannian geometric model, a nonlinear optimal regulator with a quadratic form performance index which contains the Riemannian metric tensor is designed. Since the integral manifold of the nonlinear regulator is determined to be homeomorphic to that of the linear regulator, it is expected that the basic properties of the linear regulator such as feedback structure, stability and robustness are to be reflected in those of the nonlinear regulator. To apply the above regulator theory to a real nonlinear plant, it is discussed how to distort the curvilinear coordinate axes on which a nonlinear plant behaves as a linear system. Consequently, a partial differential equation with respect to the homeomorphism is derived. Finally, the computational algorithm for the nonlinear optimal regulator is discussed and a numerical example is shown.

  • PDF

지능형 최단 경로, 최소 꺾임 경로 및 혼합형 최단 경로 찾기 (Finding Rectilinear(L1), Link Metric, and Combined Shortest Paths with an Intelligent Search Method)

  • 임준식
    • 한국정보처리학회논문지
    • /
    • 제3권1호
    • /
    • pp.43-54
    • /
    • 1996
  • 이 논문은 새로운 휴리스틱 탐색(heuristic search)방법을 이용하여, 수평 및 수 직선으로 이루어진 방해 물들이 놓인 가운데 수평 및 수직선으로 구성된 최단 거리 (rectilinear shortestpath)와 꺾이는회수가 가장 적은최소 꺾임경로(link metric shortest path) 및 이 둘을 혼합시킨 혼합형 최단 경로를 구하는 알고리즘을 서술 하고 있다. 최단 경로를 구하는 방법으로 미로 찾기형 알고리즘(maze-running algorithms)과 선형 탐색 알고리즘(line-search algorithms)의 장점만을 이용한 GMD 알고리즘(Guided Minimum Detour algorithm)을 제안하고 있으며 이를 더욱 효율 적으 로 개선한 LGMD 알고리즘 (Line-by-Line Guided Minimum Detour algorithmm)을 개발 하였다. 이들 GMD와 LGMD 알고리즘은 기존의 최단 경로를 내포하고 있는 conection group를 이용하지 않고서도 휴리스틱을 사용한 guided A 탐색(guided A* search)을 이용하여 최적의 최단 경로를 구할 수 있는 장점이 있으며 시간과 메모리 면에서 효 율을 극대화하였다. 이들 GMD와 LGMD 알고리즘은 각각 O(m+eloge+NlogN)와 O(eloge+ NlogN)의 시간과 O(e+N)의 메모리를 사용한다. 여기서 m은 탐색에 사용된 지선 (line segment)들의 수이다. 또한 LGMD는 최소 꺾임 경로(link metric shortest path)와 최단 경로와 최소의 꺾임을 조합한 혼합형 최단 경로를 구하는 데에도 적용될 수 있는 확장성을 가지고 있다.

  • PDF