• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.1
• /
• pp.91-107
• /
• 2002

This paper presents two new self-scaling variable-metric algorithms. The first is based on a known two-parameter family of rank-two updating formulae, the second employs an initial scaling of the estimated inverse Hessian which modifies the first self-scaling algorithm. The algorithms are compared with similar published algorithms, notably those due to Oren, Shanno and Phua, Biggs and with BFGS (the best known quasi-Newton method). The best of these new and published algorithms are also modified to employ inexact line searches with marginal effect. The new algorithms are superior, especially as the problem dimension increases.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.5-8
• /
• 1986

The simulation algorithm for all kinds of robots with arbitrary degrees of freedom which are combined with revolute joints or prismatic joints, or combinations was studied and implemented. This simulation package is composed of trajectory planning routine, control routine, kinematics routine using Newton-Raphson method, dynamics based on Newton-Euler method with four-bar linkage analysis, input routine and output routine.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.134-136
• /
• 1999

Not much work has been carried out on the load flow analysis of distribution networks. This paper introduces Newton-Raphson method using Distflow equation and Forward Sweeping method in the distribution networks. And that efficient solution scheme in a radial distribution network is presented. Also, simulation results of both Newton-Raphson method and Forward Sweeping method applied to a 22.9kV distribution system model with 120 load buses are analized and evaluated.

• Journal of the Korean Statistical Society
• /
• v.33 no.4
• /
• pp.401-410
• /
• 2004

We address the problem of parameter estimation in multivariate distributions under ignorable non-monotone missing data. The factoring likelihood method for monotone missing data, termed by Rubin (1974), is extended to a more general case of non-monotone missing data. The proposed method is algebraically equivalent to the Newton-Raphson method for the observed likelihood, but avoids the burden of computing the first and the second partial derivatives of the observed likelihood. Instead, the maximum likelihood estimates and their information matrices for each partition of the data set are computed separately and combined naturally using the generalized least squares method.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.429-436
• /
• 2004

This paper proposes an independent component analyses(ICAs) of the fixed-point (FP) algorithm based on Newton and secant method by adding the kurtosis, respectively. The kurtosis is applied to cluster the analyzed components, and the FP algorithm is applied to get the fast analysis and superior performance irrelevant to learning parameters. The proposed ICAs have been applied to the problems for separating the 6-mixed signals of 500 samples and 10-mixed images of $512\times512$ pixels, respectively. The experimental results show that the proposed ICAs have always a fixed analysis sequence. The results can be solved the limit of conventional ICA without a kurtosis which has a variable sequence depending on the running of algorithm. Especially. the proposed ICA can be used for classifying and identifying the signals or the images. The results also show that the secant method has better the separation speed and performance than Newton method. And, the secant method gives relatively larger improvement degree as the problem size increases.

• Nuclear Engineering and Technology
• /
• v.46 no.1
• /
• pp.109-116
• /
• 2014

An electrical resistance tomography (ERT) technique combining the particle swarm optimization (PSO) algorithm with the Gauss-Newton method is applied to the visualization of two-phase flows. In the ERT, the electrical conductivity distribution, namely the conductivity values of pixels (numerical meshes) comprising the domain in the context of a numerical image reconstruction algorithm, is estimated with the known injected currents through the electrodes attached on the domain boundary and the measured potentials on those electrodes. In spite of many favorable characteristics of ERT such as no radiation, low cost, and high temporal resolution compared to other tomography techniques, one of the major drawbacks of ERT is low spatial resolution due to the inherent ill-posedness of conventional image reconstruction algorithms. In fact, the number of known data is much less than that of the unknowns (meshes). Recalling that binary mixtures like two-phase flows consist of only two substances with distinct electrical conductivities, this work adopts the PSO algorithm for mesh grouping to reduce the number of unknowns. In order to verify the enhanced performance of the proposed method, several numerical tests are performed. The comparison between the proposed algorithm and conventional Gauss-Newton method shows significant improvements in the quality of reconstructed images.

• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.135-145
• /
• 1995

A new algorithm was given to successively fit the multiexponential function/nonlinear function to data by a weighted least squares method, using Gauss-Newton, Marquardt, gradient and DUD methods for convergence. This study also considers the problem of linear-nonlimear weighted least squares estimation which is based upon the usual Taylor's formula process.

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

In this paper, we propose another paradigm(QNBP) to be capable of overcoming Limitations of the traditional backpropagation(SDBP). QNBPis based on the method of Quasi -Newton(variable metric) with the nomalized direction vectors and computes step size through the linear search. Simulation results showed that QNBP was definitely superior to both the stochasitc SDBP and the deterministic SDBP in terms of accuracy and rate of convergence and might sumount the problem of local minima. and there was no different between DFP+SR1 and BFGS+SR1 combined algrothms in QNBP.

• The Journal of Korea Robotics Society
• /
• v.5 no.4
• /
• pp.349-358
• /
• 2010

We presents a dynamic modeling of 4-wheel 2-DOF. WMR. The classic dynamic model utilizes a greatly simplified wheel motion representation and using of a simplified dynamic model confronts with a problem for accurate position control of wheeled mobile robot. In this paper, we treats the dynamic model for describes relationship between the wheel actuator force/torque and WMR motion through the use of Newton's equilibrium laws. To calculate the WMR position in real time, we introduced the Dead-Reckoning algorithms and the simulation result show that the proposed dynamic model is useful. We can be easily extend the proposed WMR model to mobile robot of similar type and this type of methodology is useful to analyze, design and control any kinds of rolling robots.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.171-175
• /
• 1989

Newton-OPF proposed by W.F Tinny and his fellows in 1984 is most useful and powerful algorithm in optical power flow calculation. But, several problems prevent its application to practical uses. The problems are determination of active sets, initial values of variables, soft and hard weights, and discrete variables such as transformer taps. In this paper, convergence characteristics of Newton OPF is analyzed with effects of these factors using wide - used 5-bus sample system. Wide - use of results in this paper is appreciated.