• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.277-284
• /
• 2018

In this paper, a new numerical method of finding the roots of a nonlinear system is proposed, which extends the conventional fixed point iterative method by relaxing the constraints on it. The proposed method determines the real valued roots and expands the convergence region by relaxing the constraints on the conventional fixed point iterative method, which transforms the diverging root searching iterations into the converging iterations by employing the metric induced by the geometrical characteristics of a polynomial. A metric is set to measure the distance between a point of a real-valued function and its corresponding image point of its inverse function. The proposed scheme provides the convenience in finding not only the real roots of polynomials but also the roots of the nonlinear systems in the various application areas of science and engineering.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.729-732
• /
• 1995

This paper presents a Generalized Iteration (GI) which includes power method, inverse power method, shifted inverse power method, and Rayleigh quotient iteration (RQI), and modified RQI (MRQI). Furthermore, we propose a GI-based algorithm to find arbitrary eigenpairs for Hermitian matrices. The proposed algorithm appears to be much faster and more accurate than the valuable generalized MRQI of Hu (GMRQI-Hu). The idea of GI is also employed to speed up the GMRQI-Hu and we propose a modified version of Hu's GMRQI (GMRQI-Hu-mod) which is improved in the convergence rate. Some numerical simulation results are presented to confirm our contributions

• Journal of Wind Energy
• /
• v.4 no.2
• /
• pp.55-60
• /
• 2013

The mathematical implementation for inverse airfoil design of wind turbines is presented using vortex panel method based on assumptions of the two-dimensional incompressible potential flow. The vortex panel method employs linear distribution of the vortex strength to obtain the well converged solution. Stream function is adopted to get the basic formula for the inverse airfoil design, and a symmetric seed airfoil is given for initial data of the iteration approach. The final airfoil shape has been compared with the original airfoil shape for validation of the mathematical procedure.

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

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2003.03a
• /
• pp.481-490
• /
• 2003

This paper presents an efficient eigensolution method for non-proportionally damped systems. The proposed method is obtained by applying the accelerated Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linearized form of the quadratic eigenproblem. A step length and a selective scheme are introduced to increase the convergence of the solution. The step length can be evaluated by minimizing the norm of the residual vector using the least square method. While the singularity may occur during factorizing process in other iteration methods such as the inverse iteration method and the subspace iteration method if the shift value is close to an exact eigenvalue, the proposed method guarantees the nonsingularity by introducing the orthonormal condition of the eigenvectors, which can be proved analytically. A numerical example is presented to demonstrate the effectiveness of the proposed method.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.901-910
• /
• 2010

As a supplement to X-ray mammography, microwave imaging is a new and promising technique for breast cancer detection. Through solving the nonlinear inverse scattering problem, microwave tomography (MT) creates images from measured signals using antennas. In this paper, we describe a developed MT system and an iterative Gauss-Newton algorithm. At each iteration, this algorithm determines the updated values by solving the set of normal equations using Tikhonov regularization. Some examples of successful image reconstruction are presented.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1994.04a
• /
• pp.95-102
• /
• 1994

A path-switching strategy by combining the use of generalized inverse and line search is proposed. A reliable predictor for the tangent vector to bifurcation path is first computed by using the generalized inverse approach. A line search in the direction of maximum gradient of total potential at the point of intersection between the above predictor and a constant loading plane introduced in the vicinity of the detected bifurcation point is then carried out for the purpose of obtaining an improved approximation for a point on bifurcation path. With this approximation obtained, an actual point on bifurcation path is then computed through iteration on the constant loading plane.

• Journal of Mechanical Science and Technology
• /
• v.18 no.9
• /
• pp.1519-1528
• /
• 2004

Atmospheric Re-Entry guidance is divided as longitudinal and lateral. This paper proposes a longitudinal reference trajectory and control law using the inverse dynamics method with pseudospectral Legendre method. Application of this method into Re-Entry problem forces a power of calculation time-reduction due to unnecessary of integration or any iteration as well as sufficient accuracy convergence. The used guidance scheme is time-to-go.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.28-35
• /
• 2013

The Krylov-Schur algorithm has been applied to reveal the eigen-properties of the wave guide having the square cross section. The eigen-matrix equation has been constructed from FEM with the basis function of the tangential edge-vectors of the triangular element. This equation has been treated firstly with Arnoldi decomposition to obtain a upper Hessenberg matrix. The QR algorithm has been carried out to transform it into Schur form. The several eigen values satisfying the convergent condition have appeared in the diagonal components. The eigen-modes for them have been calculated from the inverse iteration method. The wanted eigen-pairs have been reordered in the leading principle sub-matrix of the Schur matrix. This sub-matrix has been deflated from the eigen-matrix equation for the subsequent search of other eigen-pairs. These processes have been conducted several times repeatedly. As a result, a few primary eigen-pairs of TE and TM modes have been obtained with sufficient reliability.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.3
• /
• pp.371-383
• /
• 1999

An efficient and numerically stable eigensolution method for structures with multiple natural frequencies is presented. The proposed method is developed by improving the well-known subspace iteration method with shift. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. In this paper, the above singularity problem has been solved by introducing side conditions without sacrifice of convergence. The proposed method is always nonsingular even if a shift is on a distinct eigenvalue or multiple ones. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.