• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.75-82
• /
• 1997

An algorithm for computing the cubic spline interpolation coefficients for polynomials is presented in this paper. The matrix equation involved is solved analytically so that numerical inversion of the coefficient matrix is not required. For $f(t)=t^m$, a set of constants along with the degree of polynomial m are used to compute the coefficients so that they satisfy the interpolation constraints but not necessarily the derivative constraints. Then, another matrix equation is solved analytically to take care of the derivative constraints. The results are combined linearly to obtain the unique solution of the original matrix equation. This algorithm is tested and verified numerically for various examples.

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

In this paper, we presents that for discrete system with matched perturbation of uncertain parameters in the state coefficient matrix A(i.e., with perturbation of A in the range of the input matrix B), the poles of the perturbed closed loop system can be placed into the preassigned circle by the static-state feedback. We discuss the robust stabilization of the system satisfying the matching condition and application to the controller design problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.27
• /
• pp.83-89
• /
• 1993

In order to model the Group Technology Problem three formulations are used, that is, generally the following formulations are used: (1) Matrix formulation, (2) Mathematical programming formulation, (3) Graph formulation. In the case of Matrix formulation, it is difficult to discribe the situation using the multi-job machine. But this paper proposed the model of Group Technology using the multi-job machin, taking the method of making practical application of principle of similarity coefficient.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.5.1-5
• /
• 2003

In this paper, we study the convergence of relaxed multisplitting and relaxed nonstationary two-stage multisplitting methods associated with a multisplitting which is obtained from the ILU factorizations for solving a linear system whose coefficient matrix is an H-matrix. Also, parallel performance results of relaxed nonstaionary two-stage multisplitting method using ILU factorizations as inner splittings on the IBM p690 supercomputer are provided to analyze theoretical results.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.04a
• /
• pp.191-196
• /
• 2004

This study proposed the analysis of mass position detection and modified stiffness due to the change of the mass and stiffness of structure by using the original and modified dynamic characteristics. The method is applied to examples of a cantilever and 3 degree of freedom by modifying the mass. The predicted detection of mass positions and magnitudes are in good agrement with these from the structural reanalysis using the modified mass.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.305-326
• /
• 2001

We introduce a class of multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. This techniques is based on a recursive two by two block incomplete LU factorization on the coefficient martix. The coarse level system is constructed as an (approximate) Schur complement. A dynamic preconditioner is obtained by solving the Schur complement matrix approximately. The novelty of the proposed techniques is to solve the Schur complement matrix by a preconditioned Krylov subspace method. Such a reduction process is repeated to yield a multilevel recursive preconditioner.

• Honam Mathematical Journal
• /
• v.8 no.1
• /
• pp.21-49
• /
• 1986

A class of singular quadratic control problem is considered. The state is governed by a higher order system of ordinary linear differential equations and very general nonstandard boundary conditions. These conditions in many important cases reduce to standard boundary conditions and because of the conditions the usual controllability condition is not needed. In the special case where the coefficient matrix of the control variable in the cost functional is a time-independent singular matrix, the corresponding optimal control law as well as the optimal controller are computed. The method of investigation is based on the theory of least-squares solutions of multi-valued operator equations.

• Tribology and Lubricants
• /
• v.36 no.6
• /
• pp.324-331
• /
• 2020

Wedging in a frictional elastic system is defined if the state of stick exists after the external loading on the system is removed. This paper presents a method to determine the critical coefficient of wedging for an elastic frictional system by considering the separation state. Wedging is always possible if the coefficient of friction exceeds a critical value known as the critical wedging coefficient. This method requires two concepts: a necessary and sufficient condition for wedging, which can be interpreted as positive spanning sets of constraint vectors existing in the wedged system, and the minimal positive basis that enables a minimum wedging coefficient. The algorithm based on the positive spanning concept is repeatedly executed after eliminating nodes from the contact stiffness matrix, for which the separation states are impending. The simulation results show that once a node enters the separation state, it never returns to the contact state again and the critical wedging coefficient reduces during repeated algorithm execution. The benefit of this method is that the computation time permits handling models with large numbers of contact nodes. The algorithm can also numerically find the critical wedging coefficient, thereby contributing to fastening and assembly performance improvements in mechanical systems.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.22 no.8
• /
• pp.573-578
• /
• 2010

Topological matrix which reflects characteristics of network connectivity has been widely used in efficient solving for complicated flow network. Using topological matrix, one can easily define continuity at each node of flow network and make algorithm to automatically generate continuity equation of matrix form. In order to analyze flow network completely it is required to satisfy energy conservation in closed loops of flow network. Fundamental cycle retrieving algorithm based on graph theory automatically constructs energy conservation equation in closed loops. However, it is often accompanied by NP-complete problem. In addition, it always needs fundamental cycle retrieving procedure for every structural change of flow network. This paper proposes alternative mathematical method to analyze flow network without fundamental cycle retrieving algorithm. Consequently, the new mathematical method is expected to reduce solving time and prevent error occurrence by means of simplifying flow network analysis procedure.

• New & Renewable Energy
• /
• v.18 no.1
• /
• pp.17-28
• /
• 2022

This paper presents an effective Markov transition matrix (EMTM), which will be used to calculate the wind speed at the target site in a wind farm to accurately predict wind energy production. The existing MTS prediction method using a Markov transition matrix (MTM) exhibits a limitation where significant prediction variations are observed owing to random selection errors and its bin width. The proposed method selects the effective states of the MTM and refines its bin width to reduce the error of random selection during a gap filling procedure in MTS. The EMTM reduces the level of variation in the repeated prediction of wind speed by using the coefficient of variations and range of variations. In a case study, MTS exhibited better performance than other MCP models when EMTM was applied to estimate a one-day wind speed, by using mean relative and root mean square errors.