• 대한수학회지
• /
• 제52권2호
• /
• pp.349-372
• /
• 2015

This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.173-184
• /
• 2004

In this paper, we find the approximate solution of a second order nonlinear partial differential equation on a simple connected region in $R^2$. We transfer this problem to a new problem of second order nonlinear partial differential equation on a rectangle. Then, we transformed the later one to an equivalent optimization problem. Then we consider the optimization problem as a distributed parameter system with artificial controls. Finally, by using the theory of measure, we obtain the approximate solution of the original problem. In this paper also the global error in $L_1$ is controlled.

• 한국CDE학회논문집
• /
• 제15권1호
• /
• pp.24-32
• /
• 2010

This paper introduces a B-spline based branch & bound algorithm for global optimization. The branch & bound is a well-known algorithm paradigm for global optimization, of which key components are the subdivision scheme and the bound calculation scheme. For this, we consider the B-spline hypervolume to approximate an objective function defined in a design space. This model enables us to subdivide the design space, and to compute the upper & lower bound of each subspace where the bound calculation is based on the LHS sampling points. We also describe a search tree to represent the searching process for optimal solution, and explain iteration steps and some conditions necessary to carry out the algorithm. Finally, the performance of the proposed algorithm is examined on some test problems which would cover most difficulties faced in global optimization area. It shows that the proposed algorithm is complete algorithm not using heuristics, provides an approximate global solution within prescribed tolerances, and has the good possibility for large scale NP-hard optimization.

• 대한수학회보
• /
• 제49권4호
• /
• pp.829-850
• /
• 2012

In this paper, we adopt symmetric interior penalty discontinuous Galerkin (SIPG) methods to approximate the solution of nonlinear viscoelasticity-type equations. We construct finite element space which consists of piecewise continuous polynomials. We introduce an appropriate elliptic-type projection and prove its approximation properties. We construct semidiscrete discontinuous Galerkin approximations and prove the optimal convergence in $L^2$ normed space.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.156-169
• /
• 1995

The purpose of this paper is to investigate the role of government in innovation. That is, how much should government invest in R&D activity for social welfare enhancement. An optimal control problem is proposed to answer the above question. Because of difficulties in solving the problem, simulation utilized to find an approximate solution. All results obtained from the simulation are very similar. The investment in R&D activity increases and reaches its maximum and then decreases continuously. If the importance of technology grows the investment in R&D activity should be expanded.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.223-235
• /
• 2006

By applying the Landau-type transformation, we transform a Stefan problem with nonlinear free boundary condition into a system consisting of a parabolic equation and the ordinary differential equations. Fully discrete finite element method is developed to approximate the solution of a system of a parabolic equation and the ordinary differential equations. We derive optimal orders of convergence of fully discrete approximations in $L_2,\;H^1$ and $H^2$ normed spaces.

• 한국생산제조학회지
• /
• 제24권2호
• /
• pp.211-216
• /
• 2015

Recently, because of the growth in the leisure industry and interest in health, the demand for bicycles has increased. In this research, considering the vertical load on a bike frame under static state conditions, the deflection and mass of the bike frame were minimized by satisfying the service condition and performing optimization. The thickness of the bicycle-frame tube was set to a design variable, and its sensitivity was confirmed by an analysis of means (ANOM). To optimize the solution, a response-surface-method (RSM) model was constructed using D-Optimal and central composite design(CCD). The optimization was performed using a non-dominant sorting genetic algorithm (NSGA-II), and the optimal solution was verified by finite-element analysis.

• 대한전자공학회논문지
• /
• 제27권4호
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

• Journal of Electrical Engineering and Technology
• /
• 제11권2호
• /
• pp.338-346
• /
• 2016

In order for the optimal solution of generators’ annual maintenance scheduling to be applicable to the actual power system it is crucial to incorporate the constraints related to the equivalent operation hours (EOHs) in the optimization model. However, most of the existing researches on the optimal maintenance scheduling are based on the assumption that the maintenances are to be performed periodically regardless of the operation hours. It is mainly because the computation time to calculate EOHs increases exponentially as the number of generators becomes larger. In this paper an efficient algorithm based on demand grouping method is proposed to calculate the approximate EOHs in an acceptable computation time. The method to calculate the approximate EOHs is incorporated into the optimization model for the maintenance scheduling with consideration on the EOHs of generators. The proposed method is successfully applied to the actual Korean power system and shows significant improvement when compared to the result of the maintenance scheduling algorithm without consideration on EOHs.

• 전자공학회논문지
• /
• 제52권3호
• /
• pp.19-24
• /
• 2015

본 논문에서는 massive multiple-input multiple-output (MIMO) 기반의 wireless powered communication network (WPCN)에서 에너지 효율을 향상시키기 위한 기지국 안테나 수 최적화 기법을 제안한다. 제안하는 기법은 massive MIMO 시스템의 채널 hardening 특성을 이용하여 채널 이득을 안테나 수에 대한 식으로 근사한다. 그리고 근사화 된 최적화 문제에 편미분을 적용한 후 Lambert-W 함수를 이용하여 최적해를 closed form으로 찾는다. 모의실험을 통해 제안하는 기법의 근사 과정과 최적화 문제를 해결하는 방법이 적절함을 보이고, closed form 해가 exhaustive search 방법으로 찾은 해와 오차가 크지 않음을 확인한다.