• 에너지공학
• /
• 제10권3호
• /
• pp.183-187
• /
• 2001

Impedance imaging for binary mixture is a kind of nonlinear inverse problem, which is usually solved iteratively by the Newton-Raphson method. Then, the ill-posedness of Hessian matrix often requires the use of a regularization method to stabilize the solution. In this study, the Levenberg-Marquredt regularization method is introduced for the binary-mixture system with various resistivity contrasts (1:2∼1:1000). Several mixture distribution are tested and the results show that the Newton-Raphson iteration combined with the Levenberg-Marquardt regularization can reconstruct reasonably good images.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제7권1호
• /
• pp.7-14
• /
• 2003

The main concern of this paper is to develop a new class of quasi-newton methods. These methods are intended for use whenever memory space is a major concern and, hence, they are usually referred to as limited memory methods. The methods developed in this work are sensitive to the choice of the memory parameter ${\eta}$ that defines the amount of past information stored within the Hessian (or its inverse) approximation, at each iteration. The results of the numerical experiments made, compared to different choices of these parameters, indicate that these methods improve the performance of limited memory quasi-Newton methods.

• 대한조선학회논문집
• /
• 제46권3호
• /
• pp.232-248
• /
• 2009

Numerical methodology to solve ship springing problem, which is basically fluid-structure interaction problem, was explored in this study. Solution of this hydroelasticity problem was sought by coupling higher order B-spline Rankine panel method and finite element method in time domain, each of which is introduced for fluid and structure domain respectively. Even though varieties of different combinations in terms of numerical scheme are possible and have been tried by many researchers to solve the problem, no systematic study regarding the characteristics of each scheme has been done so far. Here, extensive case studies have been done on the numerical schemes especially focusing on the iteration method, FE analysis of beam-like structure, handling of forward speed problem and so on. Two different iteration scheme, Newton style one and fixed point iteration, were tried in this study and results were compared between the two. For the solution of the FE-based equation of motion, direct integration and modal superposition method were compared with each other from the viewpoint of its efficiency and accuracy. Finally, calculation of second derivative of basis potential, which is difficult to obtain with accuracy within grid-based method like BEM was discussed.

• Journal of applied mathematics & informatics
• /
• 제7권1호
• /
• pp.139-159
• /
• 2000

In this manuscript we study perturbed Newton-like methods for the solution of nonlinear operator equations in a Banach space and their discretized versions in connection with the mesh independence principle. This principle asserts that the behavior of the discretized process is asymptotically the same as that for the original iteration and consequently, the number of steps required by the two processes to converge to within a given tolerance is essentially the same. So far this result has been proved by others using Newton's method for certain classes of boundary value problems and even more generally by considering a Lipschitz uniform discretization. In some of our earlierpapers we extend these results to include Newton-like methods under more general conditions. However, all previous results assume that the iterates can be computed exactly. This is mot true in general. That in why we use perturbed Newton-like methods and even more general conditions. Our results, on the one hand, extend, and on the other hand, make more practical and applicable all previous results.

• 대한전자공학회논문지SD
• /
• 제43권3호
• /
• pp.15-20
• /
• 2006

본 논문은 Newton-Raphson 방법을 기반으로 하는 table-driven 알고리듬에 대해 연구되었다. 특히 본 논문에서는 Newton-Raphson 방법을 이용한 제곱근 근사에 중점을 두었다. Newton-Raphson방법에서 최적화된 초기근사해를 구하게 되면 제곱근 근사의 정확성을 높일 수 있으며, 연산 속도 또한 빨라지게 된다. 그러므로 Newton-Raphson 알고리듬에서 초기근사해를 어떻게 결정하느냐하는 것이 전체적인 알고리듬의 성능을 평가하게 되는 중요한 이슈이다. 본 논문에서는 Newton-Raphson 알고리듬의 초기 근사해를 기하평균을 기준으로 테이블에 저장, 연산의 속도와 최대 오차율을 줄일 수 있음을 확인하였다.

• 한국전산구조공학회논문집
• /
• 제20권6호
• /
• pp.731-742
• /
• 2007

본 연구에서는 새로운 비선형해석 알고리즘인 적응형 Newton-Raphson 반복기법을 제안한다. 제안된 기법은 기존 Newton-Raphson 기법을 근간으로 적응형 부구조물화 기법을 이용하여 강성등가하중을 구하고, 이미 역행렬이 계산되어 있는 초기강성행렬에 강성등가하중을 적용하여 보정변위를 구하는 것으로 요약된다. 제안된 알고리즘의 가장 큰 특징은 하중 구간의 수에 관계없이 구조물 강성행렬에 대한 역행렬 계산을 단 한번만 수행한다는 것이다. 제안된 기법의 효율성은 강성행렬 및 역행렬 계산 후 부재강성행렬이 변경된 부재들이 연결된 자유도 수와 전체 자유도 수의 비율에 직접 관계된다. 이 비율에 따라 제안된 기법을 기존 비선형해석 기법과 보완적으로 사용함으로써 전체 비선형해석 효율을 향상시킬 수 있다.

• 대한수학회논문집
• /
• 제9권2호
• /
• pp.491-502
• /
• 1994

Many problems arising in science and engineering require the numerical solution of a system of n nonlinear equations in n unknowns: (1) given F : $R^{n}$ $\rightarrow$ $R^{n}$ , find $x_{*}$ $\epsilon$ $R^{n}$ / such that F($x_{*}$) = 0. Nonlinear problems are generally solved by iteration. Davidson [3] and Broyden [1] introduced the methods which had led to a large amount of research and a class of algorithm. This work has been called by the quasi-Newton methods, secant updates, or modification methods. Newton's method is the classical method for the problem (1) and quasi-Newton methods have been proposed to circumvent computational disadvantages of Newton's method.(omitted)

• 한국CDE학회논문집
• /
• 제3권3호
• /
• pp.183-191
• /
• 1998

There are many available algorithms based on the different approaches to solve the intersection problems between two curves. Among them, the implicitization method is frequently used since it computes precise solutions fast and is robust in lower degrees. However, once the degrees of curves to be intersected are higher than cubics, its computation time increases rapidly and the numerical stability gets worse. From this observation, it is natural to transform the original problem into a set of easier ones. Therefore, curves are subdivided appropriately depending on their geometric behavior and approximated by a set of rational quadratic Bezier cures. Then, the implicitization method is applied to compute the intersections between approximated ones. Since the solutions of the implicitization method are intersections between approximated curves, a numerical process such as Newton-Raphson iteration should be employed to find true intersection points. As the seeds of numerical process are close to a true solution through the mix-and-match process, the experimental results illustrates that the proposed algorithm is superior to other algorithms.

• 전산구조공학
• /
• 제10권2호
• /
• pp.139-148
• /
• 1997

A finite element method is programmed to analyse the nonlinear behavior of axisymmetric structures. The lst order Mindlin shell theory which takes into account the transversal shear deformation is used to formulate a conical two node element with six degrees of freedom. To evade the shear locking phenomenon which arises in Mindlin type element when the effect of shear deformation tends to zero, the reduced integration of one point Gauss Quadrature at the center of element is employed. This method is the Updated Lagrangian formulation which refers the variables to the state of the most recent iteration. The solution is searched by Newton-Raphson iteration method. The tangent matrix of this method is obtained by a finite difference method by perturbating the degrees of freedom with small values. For the moment this program is limited to the analyses of non-linear elastic problems. For structures which could have elastic stability problem, the calculation is controled by displacement.

• 대한수학회보
• /
• 제55권2호
• /
• pp.431-448
• /
• 2018

This paper is concerned with the positive definite solutions of the nonlinear matrix equation $X-A^*{\bar{X}}^{-1}A=Q$, where A, Q are given complex matrices with Q positive definite. We show that such a matrix equation always has a unique positive definite solution and if A is nonsingular, it also has a unique negative definite solution. Moreover, based on Sherman-Morrison-Woodbury formula, we derive elegant relationships between solutions of $X-A^*{\bar{X}}^{-1}A=I$ and the well-studied standard nonlinear matrix equation $Y+B^*Y^{-1}B=Q$, where B, Q are uniquely determined by A. Then several effective numerical algorithms for the unique positive definite solution of $X-A^*{\bar{X}}^{-1}A=Q$ with linear or quadratic convergence rate such as inverse-free fixed-point iteration, structure-preserving doubling algorithm, Newton algorithm are proposed. Numerical examples are presented to illustrate the effectiveness of all the theoretical results and the behavior of the considered algorithms.