• Aerospace Engineering and Technology
• /
• v.13 no.2
• /
• pp.60-65
• /
• 2014

In this paper, numerical integration method using operational matrix of integration is studied. Using the operational matrix of integration, modified fixed point iteration method is introduced in order to solve rapidly an initial value problem for non-linear equation of motion. As an example, an initial value problem for orbital motion is considered. Through the numerical example, it is shown that the algorithm is efficient from the computational time point of view.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.306-312
• /
• 2000

In this paper, the efficient architecture of small Reed-solomon architecture is suggested. Here, 3-stage pipeline is adopted. In decoding, error-location polynomials are obtained by BMA using fast iteration method, and syndrome polynomials, where calculation complexity is required, are obtained by parallel calculation using ROM table, and the roots of error location polynomial are calculated by ROM table using Chein search algorithm. In the suggested decoder, it is confirmed that 3 symbol random errors can be corrected and 124Mbps decoding rate is obtained using 25 Mhz system clock.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.9
• /
• pp.59-70
• /
• 2008

Polynomial is used to optimize crown bowl shape of a marine medium speed diesel engine piston. The primary goal of this paper is that it's for an original design through a thermal stress and highest temperature minimum. Piston is modeled using solid element with 6 design variables defined the positional coordinate value. Global optimum of design variables are found and evaluated as developed and integrated with the optimum algorithm combining genetic algorithm(GA) and tabu search(TS). Iteration for optimization is performed based on the result of finite element analysis. After optimization, thermal stress and highest temperature reduced 0.68% and 1.42% more than initial geometry.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.1
• /
• pp.41-53
• /
• 2009

A primal-dual interior point method(IPM) not only is the most efficient method for a computational point of view but also has polynomial complexity. Most of polynomialtime interior point methods(IPMs) are based on the logarithmic barrier functions. Peng et al.([14, 15]) and Roos et al.([3]-[9]) proposed new variants of IPMs based on kernel functions which are called self-regular and eligible functions, respectively. In this paper we define a new kernel function and propose a new IPM based on this kernel function which has $O(n^{\frac{2}{3}}log\frac{n}{\epsilon})$ and $O(\sqrt{n}log\frac{n}{\epsilon})$ iteration bounds for large-update and small-update methods, respectively.

• East Asian mathematical journal
• /
• v.29 no.3
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.58-65
• /
• 2021

Meta-heuristic algorithms have been developed to efficiently solve difficult problems and obtain a global optimal solution. A common feature mimics phenomenon occurring in nature and reliably improves the solution through repetition. And at the same time, the probability is used to deviate from the regional optimal solution and approach the global optimal solution. This study compares the algorithm created based on the above common points with existed SA and HS to show advantages in time and accuracy of results. Existing algorithms have problems of low accuracy, high memory, long runtime, and ignorance. In a two-variable polynomial, the existing algorithms show that the memory increases and the accuracy decrease. In order to improve the accuracy, the new algorithm increases the number of initial inputs and increases the efficiency of the search by introducing a direction using vectors. And, in order to solve the optimization problem, the results of the last experiment were learned to show the learning effect in the next experiment. The new algorithm found a solution in a short time under the experimental conditions of long iteration counts using a two-variable polynomial and showed high accuracy. And, it shows that the learning effect is effective in repeated experiments.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.2
• /
• pp.27-38
• /
• 2002

A new self-consistent mathematical model for semiconductor quantum well device was developed. The model was based on the direct solution of the Boltzmann transport equation, coupled to the Schrodinger and Poisson equations. The solution yielded the distribution function for a two-dimensional electron gas(2DEG) in quantum well devices. To solve the Boltzmann equation, it was transformed into a tractable form using a Legendre polynomial expansion. The Legendre expansion facilitated analytical evaluation of the collision integral, and allowed for a reduction of the dimensionality of the problem. The transformed Boltzmann equation was then discretized and solved using sparce matrix algebra. The overall system was solved by iteration between Poisson, Schrodinger and Boltzmann equations until convergence was attained.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.33-39
• /
• 2006

In this paper we propose the Modified Karatsuba-Ofman algorithm for polynomial multiplication to polynomials of arbitrary degree. Leone proposed optimal stop condition for iteration of Karatsuba-Ofman algorithm(KO). In this paper, we propose a Non-Redundant Karatsuba-Ofman algorithm (NRKOA) with removing redundancy operations, and design a parallel hardware architecture based on the proposed algorithm. Comparing with existing related Karatsuba architectures with the same time complexity, the proposed architecture reduces the area complexity. Furthermore, the space complexity of the proposed multiplier is reduced by 43% in the best case.

• Structural Engineering and Mechanics
• /
• v.44 no.5
• /
• pp.585-600
• /
• 2012

This paper presents a Modified Tikhonov Regularization (MTR) method in model updating for damage identification with model errors and measurement noise influences consideration. The identification equation based on sensitivity approach from the dynamic responses is ill-conditioned and is usually solved with regularization method. When the structural system contains model errors and measurement noise, the identified results from Tikhonov Regularization (TR) method often diverge after several iterations. In the MTR method, new side conditions with limits on the identification of physical parameters allow for the presence of model errors and ensure the physical meanings of the identified parameters. Chebyshev polynomial is applied to approximate the acceleration response for moderation of measurement noise. The identified physical parameter can converge to a relative correct direction. A three-dimensional unsymmetrical frame structure with different scenarios is studied to illustrate the proposed method. Results revealed show that the proposed method has superior performance than TR Method when there are both model errors and measurement noise in the structure system.