• Journal of the military operations research society of Korea
• /
• v.24 no.1
• /
• pp.146-156
• /
• 1998

Cholesky factorization is known to be inefficient to problems with dense column and network problems in interior point methods. We use the conjugate gradient method and preconditioners to improve the convergence rate of the conjugate gradient method. Several preconditioners were applied to LPABO 5.1 and the results were compared with those of CPLEX 3.0. The conjugate gradient method shows to be more efficient than Cholesky factorization to problems with dense columns and network problems. The incomplete Cholesky factorization preconditioner shows to be the most efficient among the preconditioners.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.285-292
• /
• 2001

The authors compute the Ricci curvature of the GRW space-time to obtain two conditions for the conjugate points which appear as the Timelike Convergence Condition(TCG) and the Jacobi inequality. Moreover, under such two conditions, we obtain a lower bound of the length of a unit timelike geodesic for focal points emanating form the immersed spacelike hypersurface, the graph over the fiber in the GRW space-time.

• Structural Engineering and Mechanics
• /
• v.65 no.4
• /
• pp.415-422
• /
• 2018

The Conjugate Finite-Step Length" (CFSL) algorithm is proposed to improve the efficiency and robustness of first order reliability method (FORM) for reliability analysis of highly nonlinear problems. The conjugate FORM-based CFSL is formulated using the adaptive conjugate search direction based on the finite-step size with simple adjusting condition, gradient vector of performance function and previous iterative results including the conjugate gradient vector and converged point. The efficiency and robustness of the CFSL algorithm are compared through several nonlinear mathematical and structural/mechanical examples with the HL-RF and "Finite-Step-Length" (FSL) algorithms. Numerical results illustrated that the CFSL algorithm performs better than the HL-RF for both robust and efficient results while the CFLS is as robust as the FSL for structural reliability analysis but is more efficient.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.577-588
• /
• 1996

The Bayes factor provides a possible hierarchical Bayesian approach for studying the change point problems. A hypothesis for testing change versus no change is considered using predictive distributions. When the underlying distribution is in one-parameter exponential family with conjugate priors, Bayes factors are investigated to the hypothesis above. Finally one example is provided .

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.34 no.4
• /
• pp.191-197
• /
• 2021

To calculate the induced charge of atoms in molecular dynamics, linear equations for the induced charges need to be solved. As induced charges are determined at each time step, the process involves considerable computational costs. Hence, an efficient method for calculating the induced charge distribution is required when analyzing large systems. This paper introduces the Uzawa method for solving saddle point problems, which occur in linear systems, for the solution of the Lagrange equation with constraints. We apply the accelerated Uzawa algorithm, which reduces computational costs noticeably using the Schur complement and preconditioned conjugate gradient methods, in order to overcome the drawback of the Uzawa parameter, which affects the convergence speed, and increase the efficiency of the matrix operation. Numerical models of molecular dynamics in which two gold nanoparticles are placed under external electric fields reveal that the proposed method provides improved results in terms of both convergence and efficiency. The computational cost was reduced by approximately 1/10 compared to that for the Gaussian elimination method, and fast convergence of the conjugate gradient, as compared to the basic Uzawa method, was verified.

• Korean Journal of Mathematics
• /
• v.24 no.3
• /
• pp.397-407
• /
• 2016

In this paper, the concepts of k-smoothness, k-very smoothness and k-strongly smoothness of Banach spaces are dealt with together briefly by introducing three types k-denting point regarding different topology of conjugate spaces of Banach spaces. In addition, the characterization of first type ${\omega}^*-k$ denting point is described by using the slice of closed unit ball of conjugate spaces.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.740-749
• /
• 1998

This paper proposes compression of image data using neural networks based on conjugate gradient method and dynamic tunneling system. The conjugate gradient method is applied for high speed optimization .The dynamic tunneling algorithms, which is the deterministic method with tunneling phenomenon, is applied for global optimization. Converging to the local minima by using the conjugate gradient method, the new initial point for escaping the local minima is estimated by dynamic tunneling system. The proposed method has been applied the image data compression of 12 ${\times}$12 pixels. The simulation results shows the proposed networks has better learning performance , in comparison with that using the conventional BP as learning algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.2
• /
• pp.55-62
• /
• 2019

The stereo geometry establishment based on the precise sensor modeling is prerequisite for accurate stereo data processing. Ground control points are generally required for the accurate sensor modeling though it is not possible over the area where the accessibility is limited or reference data is not available. For the areas, the relative orientation should be carried out to improve the geometric consistency between the stereo data though it does not improve the absolute positional accuracy. The relative orientation requires conjugate points that are well distributed over the entire image region. Therefore the automatic conjugate point extraction is required because the manual operation is labor-intensive. In this study, we applied the method consisting of the key point extraction, the search space minimization based on the epipolar line, and the rigorous outlier detection based on the RPCs (Rational Polynomial Coefficients) bias compensation modeling. We tested different parameters of window sizes for Kompsat-2 across track stereo data and analyzed the RPCs precision after the bias compensation for the cases whether the epipolar line information is used or not. The experimental results showed that matching outliers were inevitable for the different matching parameterization but they were successfully detected and removed with the rigorous method for sub-pixel level of stereo RPCs precision.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.173-190
• /
• 2011

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.4
• /
• pp.666-671
• /
• 2010

Multi-layer perceptron neural networks have been constructed to classify four types of defects in steam generator tubes. Three features are extracted from the signals of the eddy current testing method. These include maximum impedance, phase angle at the point of maximum impedance, and an angle between the point of maximum impedance and the point of half the maximum impedance. Two hundred sets of these features are used for training and assessing the networks. Two approaches are involved to train the networks and to classify the defect type. One is the conjugate gradient method and the other is the Broydon-Fletcher-Goldfarb-Shanno method which is recognized as the most popular algorithm of quasi-Newton methods. It is found from the computation results that the training time of the Broydon-Fletcher-Goldfarb-Shanno method is much faster than that of the conjugate gradient method in most cases. On the other hand, no significant difference of the classification performance between the two methods is observed.