• Title/Summary/Keyword: convex domain

Search Result 87, Processing Time 0.019 seconds

$C^\infty$ EXTENSIONS OF HOLOMORPHIC FUNCTIONS FROM SUBVARIETIES OF A CONVEX DOMAIN

  • Cho, Hong-Rae
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.3
    • /
    • pp.487-493
    • /
    • 2001
  • $Let \Omega$ be a bounded convex domain in C^n$ with smooth boundary. Let M be a subvariety of $\Omega$ which intersects $\partial$$\Omega$ transversally. Suppose that $\Omega$ is totally convex at any point of $\partial$M in the complex tangential directions.For f $\epsilon$O(M)$\bigcap$/TEX>$C^{\infty}$($\overline{M}$/TEX>), there exists F $\epsilon$ o ($\Omega$))$\bigcap$/TEX>$C^{\infty}$($\overline{\Omega}$/TEX>) such that F(z) = f(z) for z $\epsilon$ M.

  • PDF

DNA Sequence Visualization with k-convex Hull (k-convex hull을 이용한 DNA 염기 배열의 가시화)

  • Kim, Min Ah;Lee, Eun Jeong;Cho, Hwan Gyu
    • Journal of the Korea Computer Graphics Society
    • /
    • v.2 no.2
    • /
    • pp.61-68
    • /
    • 1996
  • In this paper we propose a new visualization technique to characterize qualitative information of a large DNA sequence. While a long DNA sequence has huge information, it is not easy to obtain genetic information from the DNA sequence. We transform DNA sequences into a polygon to compute their homology in image domain rather than text domain. Our program visualizes DNA sequences with colored random walk plots and simplify them k-convex hulls. A random walk plot represents DNA sequence as a curve in a plane. A k-convex hull simplifies a random work plot by removing some parts of its insignificant information. This technique gives a biologist an insight to detect and classify DNA sequences with easy. Experiments with real genome data proves our approach gives a good visual forms for long DNA sequences for homology analysis.

  • PDF

Domain Mapping using Nonlinear Finite Element Formulation

  • Patro, Tangudu Srinivas;Voruganti, Hari K.;Dasgupta, Bhaskar;Basu, Sumit
    • International Journal of CAD/CAM
    • /
    • v.8 no.1
    • /
    • pp.29-36
    • /
    • 2009
  • Domain mapping is a bijective transformation of one domain to another, usually from a complicated general domain to a chosen convex domain. This is directly useful in many application problems like shape modeling, morphing, texture mapping, shape matching, remeshing, path planning etc. A new approach considering the domain as made up of structural elements, like membranes or trusses, is developed and implemented using the nonlinear finite element formulation. The mapping is performed in two stages, boundary mapping and inside mapping. The boundary of the 3-D domain is mapped to the surface of a convex domain (in this case, a sphere) in the first stage and then the displacement/distortion of this boundary is used as boundary conditions for mapping the interior of the domain in the second stage. This is a general method and it develops a bijective mapping in all cases with judicious choice of material properties and finite element analysis. The consistent global parameterization produced by this method for an arbitrary genus zero closed surface is useful in shape modeling. Results are convincing to accept this finite element structural approach for domain mapping as a good method for many purposes.

FIXED POINT THEOREMS FOR INFINITE DIMENSIONAL HOLOMORPHIC FUNCTIONS

  • Harris, Lwarence-A.
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.1
    • /
    • pp.175-192
    • /
    • 2004
  • This talk discusses conditions on the numerical range of a holomorphic function defined on a bounded convex domain in a complex Banach space that imply that the function has a unique fixed point. In particular, extensions of the Earle-Hamilton Theorem are given for such domains. The theorems are applied to obtain a quantitative version of the inverse function theorem for holomorphic functions and a distortion form of Cartan's unique-ness theorem.

COEFFICIENT BOUNDS FOR p-VALENTLY CLOSE-TO-CONVEX FUNCTIONS ASSOCIATED WITH VERTICAL STRIP DOMAIN

  • Bulut, Serap
    • Korean Journal of Mathematics
    • /
    • v.29 no.2
    • /
    • pp.395-407
    • /
    • 2021
  • By considering a certain univalent function that maps the unit disk 𝕌 onto a strip domain, we introduce new subclasses of analytic and p-valent functions and determine the coefficient bounds for functions belonging to these new classes. Relevant connections of some of the results obtained with those in earlier works are also provided.

Multi-loop PID Control Method of Brushless DC Motors via Convex Combination Method

  • Kim, Chang-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.72-77
    • /
    • 2017
  • This paper proposes the explicit tuning rule of multi-loop PID controller for brushless direct current motors to predict the system behaviors in time and frequency domains, using properties of the convex combination method. The convex set of the proposed controllers formulates the envelope to satisfy the performances in time and frequency domains. The final control parameters are determined by solving the convex optimization problem subject to the constraints which are represented as convex set of time domain performances. The effectiveness of the proposed control method is shown in the numerical simulation, in which controller tuning algorithm and dynamics of brushless DC motor are well taken into account.

LQ-servo Design Method Using Convex Optimization(II) Time Domain Approach (볼록형 최적화기법을 이용한 LQ-서보 설계 방법 (II) 시간 영역에서의 접근)

  • 김상엽;서병설
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.6A
    • /
    • pp.855-861
    • /
    • 2000
  • This paper concerns a development of LQ-servo PI controller design on the basis of time-domain approach. The motivation is because the previous design techniques developed on the frequency-domain is not well suited meet the time-domain design specifications. Our development techniques used in this paper is base on the convex optimization methods including Lagrange multiplier, dual concept, semidefinite programming.

  • PDF