• Management Science and Financial Engineering
• /
• 제8권1호
• /
• pp.1-19
• /
• 2002

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.

• 수산해양기술연구
• /
• 제30권4호
• /
• pp.329-340
• /
• 1994

This paper presents a dynamic compensation methodology for robust trajectory tracking control of uncertain robot manipulators. To improve tracking performance of the system, a full model-based feedforward compensation with continuous VS-type robust control is developed in this paper(i.e,. robust decentralized adaptive control scheme). Since possible bounds of uncertainties are unknown, the adaptive bounds of the robust control is used to directly estimate the uncertainty bounds(instead of estimating manipulator parameters as in centralized adaptive control0. The global stability and robustness issues of the proposed control algorithm have been investigated extensively and rigorously via a Lyapunov method. The presented control algorithm guarantees that all system responses are uniformly ultimately bounded. Thus, it is shown that the control system is evaluated to be highly robust with respect to significant uncertainties.

• Geomechanics and Engineering
• /
• 제11권4호
• /
• pp.587-605
• /
• 2016

This study aimed to develop upper and lower bounds to predict the tunnel support pressure under the pile tip during the circular tunnel excavation. Most previous studies on the upper and lower bound methods were carried out for the single ground structures, e.g., retaining wall, foundation, ground anchor and tunnel, in the homogeneous ground conditions, since the pile-soil-tunnel interaction problem is very complicated and sophisticated to solve using those bound methods. Therefore, in the lower bound approach two appropriate stress fields were proposed for single pile and tunnel respectively, and then they were superimposed. In addition, based on the superimposition several failure mechanisms were proposed for the upper bound solution. Finally, these upper bound mechanisms were examined by shear strain data from the laboratory model test and numerical analysis using finite element method.

• Korean Journal of Mathematics
• /
• 제19권1호
• /
• pp.1-16
• /
• 2011

In this paper, using differential operator, we have introduce new class of p-valent uniformly convex functions in the unit disc U = {z : |z| < 1} and obtain the coefficient bounds, extreme bounds and radius of starlikeness for the functions belonging to this generalized class. Furthermore, partial sums $f_k(z)$ of functions $f(z)$ in the class $S^*({\lambda},{\alpha},{\beta})$ are considered. The various results obtained in this paper are sharp.

• 한국경영과학회지
• /
• 제29권4호
• /
• pp.1-10
• /
• 2004

In this paper we study bounds for characteristics of stationary waiting times in (max, +)-linear systems with a Poisson arrival process. which are prevalent in manufacturing systems, kanban systems, cyclic and acyclic fork-and-join type systems, finite or infinite capacity tandem queues with various kinds of blocking, transportation systems, and telecommunication networks, and so on. Recently, some results on series expansion for characteristics, such as higher moments, Laplace transform, and tail probability, of transient and stationary waiting times in a class of (max, +)-linear systems via Taylor series expansions have been studied. In order to overcome the computational complexity in those results, we consider bounds for characteristics of stationary waiting times using valuable stochastic ordering results. Some numerical examples are also provided.

• 대한수학회보
• /
• 제40권2호
• /
• pp.319-326
• /
• 2003

In this paper, we obtain the optimal condition of the curvature bounds guaranteeing that Euclidean cones over Aleksandrov spaces of curvature bounded above preserve the curvature bounds, by considering the Euclidean cone CS$_{r}$ $^{n}$ over n-dimensional sphere S$_{r}$ $^{n}$ of radius r. More precisely, we show that for r<1, the Euclidean cone CS$_{r}$ $^{n}$ of S$_{r}$ $^{n}$ is a CBB(0) space, but not a CBA($textsc{k}$)-space for any real $textsc{k}$$\in$R.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1432-1435
• /
• 1996

This paper obtains maximum allowable delay bounds for stability of network-based control systems and presents a network scheduling method which makes the network-induced delay be less than the maximum allowable delay bound. The maximum allowable delay bounds are obtained using the Lyapunov theorem. Using the network scheduling method, the bandwidth of a network can be allocated to each node and the sampling period of each sensor and controller can be determined. The presented method can handle three kinds of data (periodic, real-time asynchronous, and non real-time asynchronous data) and guarantee real-time transmissions of real-time synchronous data and periodic data, and possible transmissions of non real-time asynchronous data. The proposed method is shown to be useful by examples in two types of network protocols such as the token control and the central control.

• Structural Engineering and Mechanics
• /
• 제13권3호
• /
• pp.299-312
• /
• 2002

In this paper, a new method to solve the dynamic response problem for structures with interval parameters is presented. It is difficult to obtain all possible solutions with sharp bounds even an optimum scheme is adopted when there are many interval structural parameters. With the interval algorithm, the expressions of the interval stiffness matrix, damping matrix and mass matrices are developed. Based on the matrix perturbation theory and interval extension of function, the upper and lower bounds of dynamic response are obtained, while the sharp bounds are guaranteed by the interval operations. A numerical example, dynamic response analysis of a box cantilever beam, is given to illustrate the validity of the present method.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.145-155
• /
• 2015

In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.

• 제어로봇시스템학회논문지
• /
• 제13권2호
• /
• pp.147-153
• /
• 2007

The stability robustness problem of linear discrete-time systems with delayed time-varying perturbations is considered. Compared with continuous time system, little effort has been made for the discrete time system in this area. In the previous results, the bounds were derived for the case of non-delayed perturbations. There are few results for delayed perturbation. Although the results are for the delayed perturbation, they considered only the time-invariant perturbations. In this paper, the sufficient conditions for stability can be expressed as linear matrix inequalities(LMIs). The corresponding stability bounds are determined by LMI(Linear Matrix Inequality)-based algorithms. Numerical examples are given to compare with the previous results and show the effectiveness of the proposed results.