• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of Computational Design and Engineering
• /
• v.3 no.4
• /
• pp.330-336
• /
• 2016

The present work is concerned with heat and mass transfer of an electrically conducting second grade MHD fluid past a semi-infinite stretching sheet with convective surface heat flux. The analysis accounts for thermophoresis and thermal radiation. A similarity transformations is used to reduce the governing equations into a dimensionless form. The local similarity equations are derived and solved using Nachtsheim-Swigert shooting iteration technique together with Runge-Kutta sixth order integration scheme. Results for various flow characteristics are presented through graphs and tables delineating the effect of various parameters characterizing the flow. Our analysis explores that the rate of heat transfer enhances with increasing the values of the surface convection parameter. Also the fluid velocity and temperature in the boundary layer region rise significantly for increasing the values of thermal radiation parameter.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1511-1523
• /
• 2011

In this paper, we consider the smoothing Newton method for the nonlinear complementarity problems with $P_0$-function. The proposed algorithm is based on a new smoothing function and it needs only to solve one linear system of equations and perform one line search per iteration. Under the condition that the solution set is nonempty and bounded, the proposed algorithm is proved to be convergent globally. Furthermore, the local superlinearly(quadratic) convergence is established under suitable conditions. Preliminary numerical results show that the proposed algorithm is very promising.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.267-280
• /
• 2009

In this paper we investigate a simple two-level additive Schwarz preconditioner for the P1 symmetric interior penalty Galerkin method of the Poisson equation on rectangular meshes. The construction is based on the decomposition of the global space of piecewise linear polynomials into the sum of local subspaces, each of which corresponds to an element of the underlying mesh, and the global coarse subspace consisting of piecewise constants. This preconditioner is a direct combination of the block Jacobi iteration and the cell-centered finite difference method, and thus very easy to implement. Explicit upper and lower bounds for the maximum and minimum eigenvalues of the preconditioned matrix system are derived and confirmed by some numerical experiments.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.313-317
• /
• 2003

This paper suggested the initial edge map through the pre-processing of vague image before apply the GVF snake algorithm. The reason obtain for detail object outline and time efficiency GVF snake algorithm feasible extracted concave edge but mistake interested object edge for the around others. So it need to trim about the object around edges. The method is using Pixel morphological reconstruction, edge extraction mask and threshoding. The result, defend fallen local minimum edge energy and reduce iteration.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.239-254
• /
• 2006

An efficient descent method for unconstrained optimization problems is line search method in which the step size is required to choose at each iteration after a descent direction is determined. There are many ways to choose the step sizes, such as the exact line search, Armijo line search, Goldstein line search, and Wolfe line search, etc. In this paper we propose a new inexact line search for a general descent method and establish some global convergence properties. This new line search has many advantages comparing with other similar inexact line searches. Moreover, we analyze the global convergence and local convergence rate of some special descent methods with the new line search. Preliminary numerical results show that the new line search is available and efficient in practical computation.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.2
• /
• pp.69-78
• /
• 1995

Nonlinear analysis methods are developed which will enable the reliable prediction of the dynamic behavior of the space shuttle main engine(SSME) turbopumps in the presence of bearing clearances and other local nonlinearities. A computationally efficient convolution method, based on discretized Duhamel and transition matrix integral formulations, is developed for the transient analysis. In the formulation, the coupling forces due to the onlinearities are treated as external forces acting on the coupled subsystems. Iteration is utilized to determine their magnitudes at each time increament. The method is applied to a nonlinear generic model of the high pressure oxygen turthods, the convolution approach proved to be more accurate and highly more efficient. For determining the nonlinear, steady-state periodic responses, an incremental harmonic balance(IHB) method was also developed. The method was successfully used to determine dominantly harmonic and subharmonic(subsynchronous) responses of the HPOTP generic model with bearing clearances. A reduction method similar to the impedance formulation utilized with linear systems is used to reduce the housing-totor models to their coordinates at the bearing clearances.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.416-419
• /
• 2006

Numerical analysis is carried out to identify the wall thinning effect inside the feed water valve. The finite volume method is applied to make analysis for the viscous flows. The commercial cock FLUENT is used for the simulation and the GAMBIT for the grid generation. The RNG $\kappa-\varepsilon$ model is used for the turbulence and the tet-hybrid grid is applied for the modeling. The velocity vector, the pressure contour, the change of residual along the iteration number, and the dynamic head are predicted for the hydrodynamic investigation.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.968-976
• /
• 2003

In this paper, we propose a novel method for lip recognition. Lip model is built based on the concatenated gray level distribution model, and the recognition problem is simplified as the minimization problem of matching object function. The Down Hill Simplex Algorithm is used for the minimization with the proposed novel method for setting initial condition, which can refrain Iteration from converging to local minima. The proposed algorithm shows extracting lip shape from the test image where Active Shape Model fails.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.4 no.4
• /
• pp.9-17
• /
• 1996

This paper develops a sequential updating method of the Euler parameter generalized coordinates for the machine kinematics and dynamics, The Newton's method is slightly modified so as to utilize the Jacobian matrix with respect to the virtual rotation instead of this with repect to the Euler parameters. An intermediate variable is introduced and the modified Newton's method solves for the variable first. Relational equation of the intermediate variable is then solved for the Euler parameters. The solution process is carried out efficiently by symoblic inversion of the relational equation of the intermediate variable and the iteration equation of the Euler parameter normalization constraint. The proposed method is applied to a kinematic and dynamic analysis with the Generalized Coordinate Partitioning method. Covergence analysis is performed to guarantee the local convergence of the proposed method. To demonstrate the validity and practicalism of the proposed method, kinematic analysis of a motion base system and dynamic analysis of a vehicle are carried out.