• East Asian mathematical journal
• /
• v.26 no.3
• /
• pp.351-363
• /
• 2010

We introduce a special class of real recurrent polynomials $f_m$$($m{\geq}1$) of degree m+1, with positive roots $s_m$, which are decreasing as m increases. The first root $s_1$, as well as the last one denoted by $s_{\infty}$ are expressed in closed form, and enclose all $s_m$ (m > 1). This technique is also used to find weaker than before [6] sufficient convergence conditions for some popular iterative processes converging to solutions of equations.

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

• Communications of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.731-737
• /
• 2024

In this paper, we study the Hyers-Ulam stability of the classical iterative functional equation fⁿ(x) = x, the Babbage equation, using strictly monotonic approximate solutions on a real interval.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1067-1082
• /
• 2022

This paper presents a new optimal three-step eighth-order family of iterative methods for finding multiple roots of nonlinear equations. Different from the all existing optimal methods of the eighth-order, the new iterative scheme is constructed using one function and three derivative evaluations per iteration, preserving the efficiency and optimality in the sense of Kung-Traub's conjecture. Theoretical results are verified through several standard numerical test examples. The basins of attraction for several polynomials are also given to illustrate the dynamical behaviour and the obtained results show better stability compared to the recently developed optimal methods.

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

• Journal of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1015-1045
• /
• 2022

Zagier introduced the term "strange identity" to describe an asymptotic relation between a certain q-hypergeometric series and a partial theta function at roots of unity. We show that behind Zagier's strange identity lies a statement about Bailey pairs. Using the iterative machinery of Bailey pairs then leads to many families of multisum strange identities, including Hikami's generalization of Zagier's identity.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.217-223
• /
• 2002

The paper presents a single constraint equation of the direct kinematic solution of 6-dof (Stewart-Gough) platforms. Many research works have presented a single polynomial of the direct kinematics for several 6-dof platforms. However, the formulation of the polynomial has potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots. This results in heavy computational burden and time-consuming task. Thus, to overcome these problems, we use a new formulation approach, called the Tetrahedron Approach, to easily derive a single constraint equation, not a polynomial one, of the direct kinematics and use two well-known numerical iterative methods to find the solution of the single constraint equation. Their performance and characteristics are investigated through a series of simulation.

• 전기의세계
• /
• v.21 no.2
• /
• pp.9-19
• /
• 1972

The transient characteristics of separately excited d-c motor driven by thyristor d-c chopper is studied in this paper. The armature controlled system is applied. As a result of theoretrical analysis the following conculsions were drawn: (1) For the transient analysis, it is recognized that the state transition analysis is a more general method and powerful tool than the state equation method or signal flow graph method, although it includes iterative matrix calculations. And the system is dealt with a finite width sampled-data system in the state transition analysis. (2) The transient characteristics of the motor angular velocity and its torque to the sampling duration variation are compared with those due to the amplitude variation of d-c chopper voltage as follows. The attenuation rate of the transient characteristics is equal in both cases, but the initial value of the transient characteristics in former case is greater than in latter case. (3) The roots of characteristics equation of the system lie inside the unit circle of the Z-plane. Therefor the system is stable. Further it is found that as the sampling duration is decreased the relative stability is lessened.