• Title/Summary/Keyword: discrete set

Search Result 419, Processing Time 0.044 seconds

GENERALIZED DISCRETE HALANAY INEQUALITIES AND THE ASYMPTOTIC BEHAVIOR OF NONLINEAR DISCRETE SYSTEMS

  • Xu, Liguang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.5
    • /
    • pp.1555-1565
    • /
    • 2013
  • In this paper, some new generalized discrete Halanay inequalities are established. On the basis of these new established inequalities, we obtain the attracting set and the global asymptotic stability of the nonlinear discrete systems. Our results established here extend the main results in [R. P. Agarwal, Y. H. Kim, and S. K. Sen, New discrete Halanay inequalities: stability of difference equations, Commun. Appl. Anal. 12 (2008), no. 1, 83-90] and [S. Udpin and P. Niamsup, New discrete type inequalities and global stability of nonlinear difference equations, Appl. Math. Lett. 22 (2009), no. 6, 856-859].

ON ω-LIMIT SETS AND ATTRACTION OF NON-AUTONOMOUS DISCRETE DYNAMICAL SYSTEMS

  • Liu, Lei;Chen, Bin
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.4
    • /
    • pp.703-713
    • /
    • 2012
  • In this paper we study ${\omega}$-limit sets and attraction of non-autonomous discrete dynamical systems. We introduce some basic concepts such as ${\omega}$-limit set and attraction for non-autonomous discrete system. We study fundamental properties of ${\omega}$-limit sets and discuss the relationship between ${\omega}$-limit sets and attraction for non-autonomous discrete dynamical systems.

A Note on Positive Invariant Set for Linear Uncertain Discrete-Time Systems

  • Matsumoto, H.;Otsuka, N.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.571-574
    • /
    • 2005
  • This paper gives some sufficient conditions for a given polyhedral set which is represented as a set of linear inequalities to be positive D-invariant for uncertain linear discrete-time systems in the case such that the systems matrices depend linearly on uncertain parameters whose ranges are given intervals. Further, the results will be applied to uncertain linear continuous systems in the sense of the above by using Euler approximation.

  • PDF

On the stabilization of linear discrete time systems subject to input saturation

  • Choi, Jinhoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1770-1773
    • /
    • 1997
  • In this paper, a linear discrete time system subject to the input saturatioin is shown to be exponentially stabilizable on any compact subset of the constrained asymptotically stabilizable set by a linear periodic variable structure controller. We also establish tat any neutrally stable system subject to the input saturation can be globally asymptotically stabilizable via linear feedback.

  • PDF

ON THE SET OF CRITICAL EXPONENTS OF DISCRETE GROUPS ACTING ON REGULAR TREES

  • Kwon, Sanghoon
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.2
    • /
    • pp.475-484
    • /
    • 2019
  • We study the set of critical exponents of discrete groups acting on regular trees. We prove that for every real number ${\delta}$ between 0 and ${\frac{1}{2}}\;{\log}\;q$, there is a discrete subgroup ${\Gamma}$ acting without inversion on a (q+1)-regular tree whose critical exponent is equal to ${\delta}$. Explicit construction of edge-indexed graphs corresponding to a quotient graph of groups are given.

A sutyd on Production Scheduling and Capacity Requirements in Discrete Demand, Fixed Production Quantity System (이산수요, 고정량 생산시스템의 생산일정과 소요용량에 관한 연구)

  • 김만수;강석호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.2
    • /
    • pp.59-65
    • /
    • 1988
  • This paper discusses the problem of coordinating aggregate planning and production schedules, minimizing the combined set-up inventory and capacity costs. In this study, by using the relation of fixed production quantity and the number of set-up we develop a heuristirc procedure of solving the discrete demand, fixed production quantity, variable capacity problem. First, we obtain the trade-off between set-up cost and capacity cost, then search the point minimizing the combined inventory and capacity costs.

  • PDF

HOMOTOPY FIXED POINT SET $FOR \rho-COMPACT$ TORAL GROUP

  • Lee, Hyang-Sook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.1
    • /
    • pp.143-148
    • /
    • 2001
  • First, we show the finiteness property of the homotopy fixed point set of p-discrete toral group. Let $G_\infty$ be a p-discrete toral group and X be a finite complex with an action of $G_\infty such that X^K$ is nilpotent for each finit p-subgroup K of $G_\infty$. Assume X is $F_\rho-complete$. Then X(sup)hG$\infty$ is F(sub)p-finite. Using this result, we give the condition so that X$^{hG}$ is $F_\rho-finite for \rho-compact$ toral group G.

  • PDF

Quality Improvement of B-spline Surfaces through Fairing of Data Points (측정점의 순정을 통한 B-스플라인 곡면 품질의 개선)

  • 흥석용;이현찬
    • Korean Journal of Computational Design and Engineering
    • /
    • v.6 no.1
    • /
    • pp.40-47
    • /
    • 2001
  • In reverse engineering, existing products are digitized fur the computer modeling. Using the digitized data, surfaces are modeled for new products. However, in the digitizing process measuring errors or deviations can be happened often in practice. Thus, it is important to adjust such errors or deviations during the computer modeling. To adjust the errors, fairing of the modeled surfaces is performed. In this paper, we present a surface fairing algorithm based on various fairness metrics. Fairness metrics can be discrete. We adopt discrete metrics for fairing given 3D point set. The fairness metrics include discrete principal curvatures. In this paper, automatic fairing process is proposed for fairing given 3D point sets for surfaces. The process uses various fairness criteria so that it is adequate to adopt designers'intents.

  • PDF

A Variable Precision Rough Set Model for Interval data (구간 데이터를 위한 가변정밀도 러프집합 모형)

  • Kim, Kyeong-Taek
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.2
    • /
    • pp.30-34
    • /
    • 2011
  • Variable precision rough set models have been successfully applied to problems whose domains are discrete values. However, there are many situations where discrete data is not available. When it comes to the problems with interval values, no variable precision rough set model has been proposed. In this paper, we propose a variable precision rough set model for interval values in which classification errors are allowed in determining if two intervals are same. To build the model, we define equivalence class, upper approximation, lower approximation, and boundary region. Then, we check if each of 11 characteristics on approximation that works in Pawlak's rough set model is valid for the proposed model or not.