• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1205-1208
• /
• 1996

This paper proposes balanced model reduction of non-minimum phase plant. The algorithm presented in this paper is to convert high-order non-minimum phase plant into low-oder minimum phase plant using balanced model reduction. Balanced model reduction requires the error bound that Hankel singular value produces. This algorithm shows the tolerance that admits the method of this paper.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.105-108
• /
• 1997

This paper proposes a new approach of balanced model reduction using matrix pencil. The algorithm presented in this paper is to convert full-rank high-order system into rank-deficient system using perturbation made by matrix pencil method. Then the system can be truncated to a low-order system that we want via balanced realization. We discuss the comparison with other methods and the various observations by simulations.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.180-185
• /
• 2008

A new method for relative error continuous and discrete time model order reduction is proposed. The reduction technique is based on two recently developed methods, namely frequency domain balanced truncation within a frequency bound and inner-outer factorization techniques. The proposed method is of interest for practical model order reduction because in this context it shows to keep the accuracy of the approximation as high as possible without sacrificing the computational efficiency. Numerical results show the accuracy and efficiency enhancement of the method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.144-149
• /
• 2006

This paper deals with a balanced model reduction for uncertain nonlinear systems via T-S fuzzy approach. We define a generalized controllability/observability gramian and obtain a balanced state space model using generalized gramians which can be obtained from solutions of linear matrix inequalities. We present a balanced model reduction scheme by truncating not only state variables but also uncertain elements. An upper bound of the model reduction error will also be suggested. In order to demonstrate the efficacy of our method, a numerical example will be presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.333-333
• /
• 2000

When the generalized singular perturbation method is used for model reduction, the state variables of the original system is reconstructed from the reduced order model. The state reduction error is defined, which shows how well the reconstructed state variables approximate the state variables of the original system equation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.75.1-75
• /
• 2002

Several model order reduction methods for large RLC circuits have been developed in the last few years. Krylop subspace based methods are extremely effective for generating the low order models of large system but there is no optimal theory for the resulting models. Alternatively, methods based truncated balanced realization have an optimality property but are too computationally expensive to use on complicated problems such as large RLC circuits. In this paper, we present a method for improving time domain response of reduced order RLC circuits. The method used here is based on combing Krylop subspace based method and truncated balanced realization method plus residualization. The metho...

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.184-189
• /
• 2006

This paper deals with a fractional model reduction for T-S fuzzy systems with time varying delayed states. A contractive coprime factorization of time delayed T-S fuzzy systems is defined and obtained by solving linear matrix inequalities. Using generalized controllability and observability gramians of the contractive coprime factor, a balanced state space realization of the system is derived. The reduced model will be obtained by truncating states in the balanced realization and an upper bound of model approximation error is also presented. In order to demonstrate efficacy of the suggested method, a numerical example is performed.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.40 no.5
• /
• pp.326-332
• /
• 2003

This paper deals with a model reduction for linear systems with time varying delayed states. A generalized controllability and observability gramians are defined and obtained by solving linear matrix inequalities. Using the generalized controllability and observability gramians, the balanced state space equation is realized. The reduced model can be obtained by truncating states in the balanced realization and the upper bound of model approximation error is also presented. In order to demonstrate efficacy of the suggested method, a numerical example is performed.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.1-6
• /
• 2004

This paper deals with a balanced model reduction for T-S(Takagi-Sugeno) fuzzy systems with time varying state delay. We define a generalized controllability gramian and a generalized observability gramian for a stable T-S fuzzy delayed systems. We obtain a balanced state space realization using the generalized controllability and observability gramian and obtain a reduced model by truncating states from the balanced state space realization. We also present an upper bound of the approximation error. The generalized controllability gramian and observability gramian can be computed from solutions of linear matrix inequalities. We demonstrate the efficacy of the suggested method by illustrating a numerical example.