• 호남수학학술지
• /
• 제43권4호
• /
• pp.667-678
• /
• 2021

Blow-up phenomena for a nonlocal reaction-diffusion system with time-dependent coefficients are investigated under null Dirichlet boundary conditions. Using Kaplan's method with the comparison principle, we establish new blow-up criteria and obtain the upper bounds for the blow-up time of the solution under suitable measure sense in the whole-dimensional space.

• Korean Journal of Mathematics
• /
• 제29권4호
• /
• pp.785-800
• /
• 2021

In this paper, we obtain a new boundary version of the Schwarz lemma for analytic function. We give sharp upper bounds for |f'(0)| and sharp lower bounds for |f'(c)| with c ∈ ∂D = {z : |z| = 1}. Thus we present some new inequalities for analytic functions. Also, we estimate the modulus of the angular derivative of the function f(z) from below according to the second Taylor coefficients of f about z = 0 and z = z₀ ≠ 0. Thanks to these inequalities, we see the relation between |f'(0)| and 𝕽f(0). Similarly, we see the relation between 𝕽f(0) and |f'(c)| for some c ∈ ∂D. The sharpness of these inequalities is also proved.

• 전자공학회논문지SC
• /
• 제44권2호
• /
• pp.1-9
• /
• 2007

이 논문에서는 델타연산자를 사용하는 단일접근법에 의해 단일분산시스템에 대한 변동경계치의 새로운 결과를 제시하였다. 시스템 불확실성이 존재하는 경우에 대한 새로운 장인 안정성 경계치를 이용하여 단일 분산시스템의 강인 안정성 해석이 수행되었다. 새로운 단일 안정성 경계치는 단일 리아프노프 행렬 방정식에 근거하여 개발되었다. 또한 새로운 단일 경계치가 적용되었을 때 시스템이 그 안정성을 유지함을 나타내었고 예제가 이 제안된 결과를 입증하기 위해 제시되었다.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.497-504
• /
• 2006

This paper presents a new technique that derives the dynamic acceleration bounds of multiple cooperating robot systems from given individual torque limits of robots. A set of linear algebraic homogeneous equation is derived from the dynamic equations of multiple robots with friction contacts. The mobility of the robot system is analyzed by the decomposition of the null space of the linear algebraic equation. The acceleration bounds of multiple robot systems are obtained from the joint torque constraints of robots by the medium of the decomposed null space. As the joint constraints of the robots are given in the infinite norm sense, the resultant acceleration bounds of the systems are described as polytopes. Several case studies are presented to validate the proposed method in this paper.

• Structural Engineering and Mechanics
• /
• 제12권6호
• /
• pp.669-684
• /
• 2001

A new method for solving the uncertain eigenvalue problems of the structures with interval parameters, interval finite element method based on the element, is presented in this paper. The calculations are done on the element basis, hence, the efforts are greatly reduced. In order to illustrate the accuracy of the method, a continuous beam system is given, the results obtained by it are compared with those obtained by Chen and Qiu (1994); in order to demonstrate that the proposed method provides safe bounds for the eigenfrequencies, an undamping spring-mass system, in which the exact interval bounds are known, is given, the results obtained by it are compared with those obtained by Qiu et al. (1999), where the exact interval bounds are given. The numerical results show that the proposed method is effective for estimating the eigenvalue bounds of structures with interval parameters.

• 한국정밀공학회지
• /
• 제18권1호
• /
• pp.171-179
• /
• 2001

The purpose of this paper is the derivation and development of the new definitions and methods for the new estimation of robustness for the systems having structured uncertainties. This proposition adopts the theoretical analysis of the Lyapunov direct methods, that is, the sign properties of the Lyapunov function derivative integrated along finite intervals of time, in place of the original method of the sign properties of the time derivative of the Lyapunov function itself. This is the new sufficient criteria to relax the stability condition and is used to generate techniques for the robust design of control systems with structured perturbations. The systems considered are assumed to be nominally linear, with time-variant, nonlinear bounded perturbations. This new techniques demonstrate the improvement of robustness bounds from the numerical results.

• International Journal of Control, Automation, and Systems
• /
• 제1권1호
• /
• pp.127-133
• /
• 2003

This paper proposes a new numerical method to check the stability of a general class of time delay systems. The proposed method checks whether there are characteristic roots whose real values are nonnegative through two steps. Firstly, rectangular bounds of characteristic roots whose real values are nonnegative are computed. Secondly, the existence of roots inside the bounds are checked using the numerical computation of argument principles. An adaptive discretization is proposed for the numerical computation of argument principles.

• Journal of the Korean Statistical Society
• /
• 제23권1호
• /
• pp.187-198
• /
• 1994

We derive a new Cramer-Rao type lower bound for the reciprocal of the density height of the median-unbiased estimators which improves most of the previous lower bounds and is attainable under much weaker conditions. We also identify useful necessary and sufficient condition for the attainability of the lower bound which is considerably weaker than those for the mean-unbiased estimators. It is shown that these lower bounds are attained not only for the family of continuous distributions with monotone likelihood ratio (MLR) property but also for the location and scale families with strong unimodal property.

• 대한수학회보
• /
• 제50권5호
• /
• pp.1531-1538
• /
• 2013

In the present investigation, the author introduces two interesting subclasses of normalized meromorphic univalent functions $w=f(z)$ defined on $\tilde{\Delta}:=\{z{\in}\mathbb{C}:1<{\mid}z{\mid}<{\infty}\}$ whose inverse $f^{-1}(w)$ is also univalent meromorphic in $\tilde{\Delta}$. Estimates for the initial coefficients are obtained for the functions in these new subclasses.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.881-888
• /
• 2001

Recently, Hooda and Ram [7] have proposed and characterized a new generalized measure of R-norm entropy. In the present communication we have studied its application in coding theory. Various mean codeword lengths and their bounds have been defined and a coding theorem on lower and upper bounds of a generalized mean codeword length in term of the generalized R-norm entropy has been proved.