• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.134-137
• /
• 2003

Newton-Raphson is most used algorithm in EIT(electrical impedance tomography), cross-sectional distribution of resistivity is reconstructed by mean of both generating and sensing electrodes attached onto the surface of the object. EIT has been suffered from the severe ill-posedness which is caused by the inherent low sensitivity of boundary measurements to any changes of internal resistivity values. In this paper, we propose modified cost function and weighting factor that compensate for low sensitivity between boundary measurements and internal resistivity and improve performance of Newton-Raphson for EIT in region of interest.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.9 no.1
• /
• pp.156-162
• /
• 2001

An effective and practical method is presented for solving the forward kinematics of a 6-DOF Stewart Platform, using neural network algorithm together with Newton-Raphson method. An approximated solution is obtained from trained neural network, then it is used as an initial estimate for Newton-Raphson method. A series of accurate solutions are calculated with reasonable speed for the entire workspace of the platform. The solution procedure can be used for driving a real-time simulation platform.

• Structural Engineering and Mechanics
• /
• v.21 no.2
• /
• pp.121-136
• /
• 2005

This paper presents the implementation of the Blatz-Ko hyperelastic compressible model in a finite element program to deal with large deformation problems. We show analytically and numerically that the minimum number of increment steps in the Newton-Raphson algorithm depends on material properties and applied loads. We also show that this dependence is related to the orientation preservation principle. So we propose a convergence criteria based on the sign of eigenvalues of the deformation gradient matrix.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.6
• /
• pp.31-37
• /
• 2013

Modern graphic processors, multimedia processors and audio processors mostly use floating-point number. High-level language such as C and Java use both single precision and double precision floating-point number. In this paper, an algorithm which computes the reciprocal of double precision floating-point number using a 32 bit multiplier is proposed. It divides the mantissa of double precision floating-point number to upper part and lower part, and calculates the reciprocal of the upper part with Newton-Raphson algorithm. And it computes the reciprocal of double precision floating-point number with calculated upper part reciprocal as the initial value. Since the number of multiplications performed by the proposed algorithm is dependent on the mantissa of floating-point number, the average number of multiplications per an operation is derived from some reciprocal tables with varying sizes.

• Journal of IKEEE
• /
• v.4 no.2 s.7
• /
• pp.249-256
• /
• 2000

In EIT(electrical impedance tomography), the internal resistivity(or conductivity) distribution of the unknown object is estimated using the boundary voltage data induced by different current patterns using various reconstruction algorithms. In this paper, we present a regularized modified Newton-Raphson(mNR) scheme which employs additional a priori information in the cost functional as soft constraint and the weighting matrices in the cost functional are selected based on the exponentially weighted least square criterion. The computer simulation for the 32 channels synthetic data shows that the reconstruction performance of the proposed scheme is improved compared to that of the conventional regularized mNR at the expense of slightly increased computational burden.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.311-315
• /
• 1998

Load Flow calculation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning, operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to solve load flow equation and to modify above defects. And it preserve certain part of Jacobian matrix to shorten the time of calculation. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical result and the number of iteration got by Newton-Raphson method. The effect of time reduction showed about 28%, 30%, at each case of 39 bus, 118 bus system.

• Proceeding of KASS Symposium
• /
• 2006.05a
• /
• pp.170-174
• /
• 2006

This paper presents a new nonlinear analysis algorithm which uses the equivalent nodal load for the element stiffness. The equivalent nodal load represents the influence of the stiffness change such as the addition of elements, the deletion of elements, and/or the partial change of element stiffness. The nonlinear analysis of structures using the equivalent load improves the efficiency very much because the inverse of the structural stiffness matrix, which needs a large amount of computation to calculate, is reused in each loading step. In this paper, the concept of nonlinear analysis using the equivalent load for the element stiffness is described and some numerical examples are provided to verify it.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.32-35
• /
• 2004

In boundary estimation in Electrical Impedance Tomography (EIT), conventional method is the modified Newton Raphson (mNR) method .The mNR is famous for good method since has good convergence and robustness against noisy data. But the mNR is low efficiency to get and update Jacobian matrix. So, the mNR become very slow algorithm. We propose the Quasi Newton (QN) method to improve efficiency which will lead to speed up in boundary estimation. The QN can improve a low efficiency by using estimated Jacobian matrix contrary to using exactly calculated Jacobian matrix, this used by the mNR. And finally, we propose the modified Quasi Newton (mQN) method because the QN has some problems such as bad early convergence rate and instability of 'divided by zero'. For the verification of the propose method, numerical experiments are conducted and the results show a good performance.

• 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.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.11
• /
• pp.1394-1400
• /
• 1999

This paper presents and efficient improvement of the iterative eigenvalue calculation method and the selection of initial values in AESOPS algorithm. To determine the initial eigenvalues of the system, system state matrix is constructed with the two-axis generator model. From the submatrices including synchronous and damping coefficients, the initial eigenvalues are calculated by the QR method. Participation factors are also calculated from the above submatrices in order to determine the generators which have a important effect to the specific oscillation mode. Also, the heuristically approximated eigenvalue calculation method in the AESOPS algorithm is transformed to the Newton Raphson Method which is largely used in the nonlinear numerical analysis. The new methods are developed from the AESOPS algorithm and thus only a few calculation steps are added to practice the proposed algorithm.