• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.10 no.2
• /
• pp.18-28
• /
• 2001

Super computers has been utilized to carry out vehicle dynamics in real time. This research propose an implicit integra-tion method for vehicle state variables. Newton chord method is empolyed to solve the equations of motion and con-straints. The equations of motion and constraints are formulated such that the Jacobian matrix for Newton chord method is needed to be computed only once for a dynamic analysis. Numerical experiments showed that the Jacobian matrix generat-ed at the initial time could have been utilized for the Newton chord iterations throughout simulations under various driving conditions. Convergence analysis of Newton chord method with the proposed Jacobian updating method is carried out. The proposed algorithm yielded accurate solutions for a prototype vehicle multibody model in realtime on a 400 MHz PC compatible.

• Journal for History of Mathematics
• /
• v.29 no.4
• /
• pp.243-254
• /
• 2016

This research identifies the elements of the methodologies of Newton's discovery of his dynamics. These methodologies involve the transformation of preceding theoretical concepts and the discovery of common cause. This essay consists of two parts within historical case studies of Newton's works. The elements of the method of discovery consists of the transformation of preceding concepts and the identification of common cause in the formation of the research program's hard cores and protective belts. Newton transformed their predecessors' concepts to find out appropriate common causes in his dynamical theory. The transformed theoretical concepts are synthesized to be constructed as the elements of common cause which provide the foundations of Newtonian research programs.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.765-772
• /
• 2000

In this study we are concerned with the problem of approximating a solution of a nonlinear equation in Banach space using Newton-like methods. Due to rounding errors the sequence of iterates generated on a computer differs from the sequence produced in theory. Using Lipschitz-type hypotheses on the second Frechet-derivative instead of the first one, we provide sufficient convergence conditions for the inexact Newton-like method that is actually generated on the computer. Moreover, we show that the ratio of convergence improves under our conditions. Furthermore, we provide a wider choice of initial guesses than before. Finally, a numerical example is provided to show that our results compare favorably with earlier ones.

• Communications of the Korean Mathematical Society
• /
• v.9 no.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)

• Journal of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.251-266
• /
• 2014

In this paper, we use Newton's method to approximate a locally unique solution of an equation in Banach spaces and introduce recurrent functions to provide a weaker semilocal convergence analysis for Newton's method than before [1]-[13], in some interesting cases, provided that the Fr$\acute{e}$chet-derivative of the operator involved is p-H$\ddot{o}$lder continuous (p${\in}$(0, 1]). Numerical examples involving two boundary value problems are also provided.

• Journal of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1529-1540
• /
• 2018

The matrix equation $X^p+A^*XA=Q$ has been studied to find the positive definite solution in several researches. In this paper, we consider fixed-point iteration and Newton's method for finding the matrix p-th root. From these two considerations, we will use the Newton-Schulz algorithm (N.S.A). We will show the residual relation and the local convergence of the fixed-point iteration. The local convergence guarantees the convergence of N.S.A. We also show numerical experiments and easily check that the N.S. algorithm reduce the CPU-time significantly.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.2
• /
• pp.267-275
• /
• 2012

We present new results for the local convergence of Newton's method to a unique solution of an equation in a Banach space setting. Under a flexible gamma-type condition [12], [13], we extend the applicability of Newton's method by enlarging the radius and decreasing the ratio of convergence. The results can compare favorably to other ones using Newton-Kantorovich and Lipschitz conditions [3]-[7], [9]-[13]. Numerical examples are also provided.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.7
• /
• pp.1053-1058
• /
• 2017

In this paper, the design of iron loss minimization of 600W was performed by using Quasi-Newton method. Stator shoe, the width of stator teeth and yoke, and the length of d-axis flux path were selected as design parameters, and the output characteristics according to each design variable were considered. The objective function was set to minimize iron loss. Using the Quasi-Newton method, the variables converged to the target value while changing simultaneously and multiple times. As the algorithm advanced optimization, the correlation with the behavior of each variable was compared and analyzed.

• East Asian mathematical journal
• /
• v.35 no.3
• /
• pp.341-349
• /
• 2019

In this paper, we are concerned with the minimal positive solution to system of the nonlinear matrix equations $A_1X^2+B_1Y +C_1=0$ and $A_2Y^2+B_2X+C_2=0$, where $A_i$ is a positive matrix or a nonnegative irreducible matrix, $C_i$ is a nonnegative matrix and $-B_i$ is a nonsingular M-matrix for i = 1, 2. We apply Newton's method to system and present a modified Newton's iteration which is validated to be efficient in the numerical experiments. We prove that the sequences generated by the modified Newton's iteration converge to the minimal positive solution to system of nonlinear matrix equations.

• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.311-327
• /
• 2019

The aim of this paper is to extend the applicability of Gauss-Newton method for solving underdetermined nonlinear least squares problems in cases not covered before. The novelty of the paper is the introduction of a restricted convergence domain. We find a more precise location where the Gauss-Newton iterates lie than in earlier studies. Consequently the Lipschitz constants are at least as small as the ones used before. This way and under the same computational cost, we extend the local as well the semilocal convergence of Gauss-Newton method. The new developmentes are obtained under the same computational cost as in earlier studies, since the new Lipschitz constants are special cases of the constants used before. Numerical examples further justify the theoretical results.