• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.347-350
• /
• 2004

In this paper, the acceleration is studied for the rigid-plastic FEM of metal forming simulation. In the FEM, the direct iteration and Newton-Raphson iteration are applied to obtain the initial solution and accurate solution respectively. In general, the acceleration scheme for the direct iteration is not used. In this paper, an Aitken accelerator is applied to the direct iteration. In the modified Newton-Raphson iteration, the step length or the deceleration coefficient is used for the fast and robust convergence. The step length can be determined by using the accelerator. The numerical experiments have been performed for the comparisons. The faster convergence is obtained with the acceleration in the direct and Newton-Raphson iterations.

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

• East Asian mathematical journal
• /
• v.29 no.5
• /
• pp.511-519
• /
• 2013

There are various methods for evaluating a matrix square root, which is a solvent of the quadratic matrix equation $X^2-A=0$. We consider new iterative methods for solving matrix square roots of M-matrices. Particulary we show that the relaxed binomial iteration is more efficient than Newton-Schulz iteration in some cases. And we construct a formula to find relaxation coefficients through statistical experiments.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1831-1844
• /
• 2016

In this paper, we improve the full-Newton step infeasible interior-point algorithm proposed by Mansouri et al. [6]. The algorithm takes only one full-Newton step in a major iteration. To perform this step, the algorithm adopts the largest logical value for the barrier update parameter ${\theta}$. This value is adapted with the value of proximity function ${\delta}$ related to (x, y, s) in current iteration of the algorithm. We derive a suitable interval to change the parameter ${\theta}$ from iteration to iteration. This leads to more flexibilities in the algorithm, compared to the situation that ${\theta}$ takes a default fixed value.

• Journal of Powder Materials
• /
• v.30 no.1
• /
• pp.29-34
• /
• 2023

A fixed-point iteration is proposed to integrate the stress and state variables in the incremental analysis of plastic deformation. The Conventional Newton-Raphson method requires a second-order derivative of the yield function to generate a complicated code, and the convergence cannot be guaranteed beforehand. The proposed fixed-point iteration does not require a second-order derivative of the yield function, and convergence is ensured for a given strain increment. The fixed-point iteration is easier to implement, and the computational time is shortened compared with the Newton-Raphson method. The plane-stress condition is considered for the biaxial loading conditions to confirm the convergence of the fixed-point iteration. 3-dimensional tensile specimen is considered to compare the computational times in the ABAQUS/explicit finite element analysis.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.11
• /
• pp.880-885
• /
• 2017

In AD-MUSIC algorithm, DOD/DOA can be estimated without computationally expensive two-dimensional search. In this paper, to further reduce the computational complexity, the Newton type method has been applied to one-dimensional search. In this paper, we summarize the formulation of the AD-MUSIC algorithm, and present how to apply Newton-type iteration to AD-MUSIC algorithm for improvement of the accuracy of the DOD/DOA estimates. Numerical results are presented to show that the proposed scheme is efficient in the viewpoints of computational burden and estimation accuracy.

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

• Korean Journal of Mathematics
• /
• v.9 no.1
• /
• pp.67-73
• /
• 2001

For some equation related with exponential function, we seek roots and find the properties of the roots. By using the relation of the roots and attractors, we find a region in the basin of attraction of the attractor at infinity for Newton's method for solving given equation.

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

• Computational Structural Engineering
• /
• v.11 no.1
• /
• pp.205-216
• /
• 1998

A solution method is presented to solve the eigenvalue problem arising in the dynamic analysis of nonclassicary damped structural systems with multiple eigenvalues. The proposed method is obtained by applying the modified Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linear eigenproblem through matrix augmentation of the quadratic eigenvalue problem. In the iteration methods such as the inverse iteration method and the subspace iteration method, singularity may be occurred during the factorizing process when the shift value is close to an eigenvalue of the system. However, even though the shift value is an eigenvalue of the system, the proposed method provides nonsingularity, and that is analytically proved. Since the modified Newton-Raphson technique is adopted to the proposed method, initial values are need. Because the Lanczos method effectively produces better initial values than other methods, the results of the Lanczos method are taken as the initial values of the proposed method. Two numerical examples are presented to demonstrate the effectiveness of the proposed method and the results are compared with those of the well-known subspace iteration method and the Lanczos method.