• Title/Summary/Keyword: convex domain

Search Result 87, Processing Time 0.02 seconds

A Study on the Overlap of Grid Lines around a Sharp Convex Corner with the Elliptic Grid Generation Schemes (날카로운 볼록 코너 주위의 타원형 격자 생성 기법에 의한 격자선의 겹침에 대한 고찰)

  • Kim Byoungsoo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1998.05a
    • /
    • pp.55-60
    • /
    • 1998
  • An elliptic grid generation scheme using Laplace's equations guarantees the resulting grids to be crossing-free as a result of maximum principle in its analytic form. Numerical results, however, often show the grid lines overlapping each other or crossing the boundaries, especially for very sharp convex corners. The cause of this problem is investigated, and it is found that this problem can be handled by properly modifying the coefficients of transformed Laplace's equations in the computational domain.

  • PDF

BOUNDARY BEHAVIOR OF HOLOMORPHIC DISCS IN CONVEX FINITE TYPE DOMAINS

  • Lee, Kang-Hyurk
    • East Asian mathematical journal
    • /
    • v.31 no.3
    • /
    • pp.351-356
    • /
    • 2015
  • In this paper, we study holomorphic discs in a domain with a plurisubharmonic peak function at a boundary point. The aim is to describe boundary behavior of holomorphic discs in convex finite type domains in the complex Euclidean space in term of a special local neigh-borhood system at a boundary point.

LOWER HOUNDS ON THE HOLOMORPHIC SECTIONAL CURVATURE OF THE BERGMAN METRIC ON LOCALLY CONVEX DOMAINS IN $C^{n}$

  • Cho, Sang-Hyun;Lim, Jong-Chun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.1
    • /
    • pp.127-134
    • /
    • 2000
  • Let $\Omega$ be a bounded pseudoconvex domain in$C^{n}$ with smooth defining function r and let$z_0\; {\in}\; b{\Omega}$ be a point of finite type. We also assume that $\Omega$ is convex in a neighborhood of $z_0$. Then we prove that all the holomorphic sectional curvatures of the Bergman metric of $\Omega$ are bounded below by a negative constant near $z_0$.

  • PDF

Optimum Tuning of PID-PD Controller considering Robust Stability and Sensor Noise Insensitivity (센서 잡음 저감도 및 안정-강인성을 고려한 PID-PD 제어기의 최적 동조)

  • Kim, Chang-Hyun;Lim, Dong-Kyun;Suh, Byung-Suhl
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.628-631
    • /
    • 2005
  • In this paper, we propose tuning method of PID-PD controller to satisfy design specifications in frequency domain as well as time domain. The proposed tuning method of PID-PD controller that consist of the convex set of PID and PI-PD controller controls the closed-loop response to locate between the step responses, and Bode magnitudes of closed-loop transfer functions controlled by PID and PI-PD controller. The controller is designed by the optimum tuning method to minimize the proposed specific cost function subject to sensor noise insensitivity and robust stability. Its effectiveness is examined by the case study and analysis.

  • PDF

New Formulation of MNDIF Method for Extracting Accurate Natural Frequencies of Plates (평판의 고정밀도 고유진동수 추출을 위한 개선된 MNDIF법 정식 개발)

  • Kang, Sang-Wook;Yoon, Juil
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.23 no.8
    • /
    • pp.725-733
    • /
    • 2013
  • An improved formulation of the MNDIF method is introduced to extract highly accurate natural frequencies of concave plates with arbitrary shape. Originally, the MNDIF method cannot yield accurate natural frequencies for concave plates. It can be applicable to only convex plates. To overcome this weak point, a new approach of dividing a concave plate into two convex domains and applying the MNDIF method to each domain is proposed and the validity and accuracy are shown in verification examples.

SOLUTION TO ${\bar{\partial}}$-PROBLEM WITH SUPPORT CONDITIONS IN WEAKLY q-CONVEX DOMAINS

  • Saber, Sayed
    • Communications of the Korean Mathematical Society
    • /
    • v.33 no.2
    • /
    • pp.409-421
    • /
    • 2018
  • Let X be a complex manifold of dimension n $n{\geqslant}2$ and let ${\Omega}{\Subset}X$ be a weakly q-convex domain with smooth boundary. Assume that E is a holomorphic line bundle over X and $E^{{\otimes}m}$ is the m-times tensor product of E for positive integer m. If there exists a strongly plurisubharmonic function on a neighborhood of $b{\Omega}$, then we solve the ${\bar{\partial}}$-problem with support condition in ${\Omega}$ for forms of type (r, s), $s{\geqslant}q$ with values in $E^{{\otimes}m}$. Moreover, the solvability of the ${\bar{\partial}}_b$-problem on boundaries of weakly q-convex domains with smooth boundary in $K{\ddot{a}}hler$ manifolds are given. Furthermore, we shall establish an extension theorem for the ${\bar{\partial}}_b$-closed forms.

Boundary Artifacts Reduction in View Synthesis of 3D Video System (3차원 비디오의 합성영상 경계 잡음 제거)

  • Lee, Dohoon;Yang, Yoonmo;Oh, Byung Tae
    • Journal of Broadcast Engineering
    • /
    • v.21 no.6
    • /
    • pp.878-888
    • /
    • 2016
  • This paper proposes an efficient method to remove the boundary artifacts of rendered views caused by damaged depth maps in the 3D video system. First, characteristics of boundary artifacts with the compression noise in depth maps are carefully studied. Then, the artifacts suppression method is proposed by the iterative projection onto convex sets (POCS) algorithm with setting the convex set in pixel and frequency domain. The proposed method is applied to both texture and depth maps separately during view rendering. The simulation results show the boundary artifacts are greatly reduced with improving the quality of synthesized views.

CONVEX POLYTOPES OF GENERALIZED DOUBLY STOCHASTIC MATRICES

  • Cho, Soo-Jin;Nam, Yun-Sun
    • Communications of the Korean Mathematical Society
    • /
    • v.16 no.4
    • /
    • pp.679-690
    • /
    • 2001
  • Doubly stochastic matrices are n$\times$n nonnegative ma-trices whose row and column sums are all 1. Convex polytope $\Omega$$_{n}$ of doubly stochastic matrices and more generally (R,S), so called transportation polytopes, are important since they form the domains for the transportation problems. A theorem by Birkhoff classifies the extremal matrices of , $\Omega$$_{n}$ and extremal matrices of transporta-tion polytopes (R,S) were all classified combinatorially. In this article, we consider signed version of $\Omega$$_{n}$ and (R.S), obtain signed Birkhoff theorem; we define a new class of convex polytopes (R,S), calculate their dimensions, and classify their extremal matrices, Moreover, we suggest an algorithm to express a matrix in (R,S) as a convex combination of txtremal matrices. We also give an example that a polytope of signed matrices is used as a domain for a decision problem. In this context of finite reflection(Coxeter) group theory, our generalization may also be considered as a generalization from type $A_{*}$ n/ to type B$_{n}$ D$_{n}$. n/.

  • PDF

LQ-servo Design Method Using Convex Optimization (I) Frequency Domain Approach (볼록형 최적화기법을 이용한 LQ-서보 설계 방법(I) 주파수 영역에서의 접근)

  • 이응석;서병설
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.7B
    • /
    • pp.1282-1291
    • /
    • 2000
  • 기존의 LQ-서보형 PI 설계방법은 보드선도 상에서 저주파와 고주파 영역에서의 루프전단함수의 특이값 일치에 기이한 설계상의 문제를 가지고 있다. 이러한 점을 해결하기 위해 역 최적제어와 볼록형 최적화기법에 기초한 새로운 설계 방법을 제안하고자 한다.

  • PDF