• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.773-781
• /
• 2010

Recently, Yun [8] proposed a new three-step iterative method with the fourth-order convergence for solving nonlinear equations. By using his ideas, we develop a general form of multi-step iterative methods with higher order convergence for solving nonlinear equations, and then we study convergence analysis of the multi-step iterative methods. Lastly, some numerical experiments are given to illustrate the performance of the multi-step iterative methods.

• ETRI Journal
• /
• 제37권3호
• /
• pp.533-540
• /
• 2015

In wireless localization, several linear closed-form solution (LCS) methods have been investigated as a direct result of the drawbacks that plague the existing iterative methods, such as the local minimum problem and heavy computational burden. Among the known LCS methods, both the direct solution method and the difference of squared range measurements method are considered in this paper. These LCS methods do not have any of the aforementioned problems that occur in the existing iterative methods. However, each LCS method does have its own individual error property. In this paper, a hybrid LCS method is presented to reduce these errors. The hybrid LCS method integrates the two aforementioned LCS methods by using two check points that give important information on the probability of occurrence of each LCS's individual error. The results of several Monte Carlo simulations show that the proposed method has a good performance. The solutions provided by the proposed method are accurate and reliable. The solutions do not have serious errors such as those that occur in the conventional standalone LCS and iterative methods.

• 전자공학회논문지B
• /
• 제33B권12호
• /
• pp.62-70
• /
• 1996

Image restoration is the process which estimates the original image form the blurred image observed by the non-ideal imaging system with additivenoise. According to the regularized approach, the resotred image can be obtained by iterative methods or the constrained least square error(CLS) filter. Among those retoratin methods, despite of many advantages, iterative iamge restoration is limited in use because of slow convergence. In the present paper, fast iterative image restoration algorithms based on preconditoning are proposed. The preconditioner can be obtained by using the characteristics finite impulse response (FIR) filter structure.

• 제어로봇시스템학회논문지
• /
• 제13권7호
• /
• pp.683-687
• /
• 2007

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and Closed-Form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-Form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a Self-Tuning Weighted Least Square AOA algorithm that is a modified version of the conventional Closed-Form solution. In order to estimate the error covariance matrix as a weight, a two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2006년도 International Symposium on GPS/GNSS Vol.1
• /
• pp.485-489
• /
• 2006

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and closed-form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a self-tuning weighted least square AOA algorithm that is a modified version of the conventional closed-form solution. In order to estimate the error covariance matrix as a weight, two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

• Nuclear Engineering and Technology
• /
• 제53권7호
• /
• pp.2084-2094
• /
• 2021

Delta-form-based methods for solving high order spatial discretization schemes are introduced into the reactor S_N transport equation. Due to the nature of the delta-form, the final numerical accuracy only depends on the residuals on the right side of the discrete equations and have nothing to do with the parts on the left side. Therefore, various high order spatial discretization methods can be easily adopted for only the transport term on the right side of the discrete equations. Then the simplest step or other robust schemes can be adopted to discretize the increment on the left hand side to ensure the good iterative convergence. The delta-form framework makes the sweeping and iterative strategies of various high order spatial discretization methods be completely the same with those of the traditional S_N codes, only by adding the residuals into the source terms. In this paper, the flux limiter method and weighted essentially non-oscillatory scheme are used for the verification purpose to only show the advantages of the introduction of delta-form-based solving methods and other high order spatial discretization methods can be also easily extended to solve the S_N transport equations. Numerical solutions indicate the correctness and effectiveness of delta-form-based solving method.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 춘계학술대회 논문집
• /
• pp.363-368
• /
• 1995

A general method of solving inverse kinematics of three-joint manipulator composed of revolute joints or prismatic joints or combinations of those joints is presented in this study. In completing real-time control, it is very important to obtain the closed form solutions of inverse kinematics rather than iterative numerical solutions, because iterative numerical solutions are generally much slower than the corresponding closed form solutions. If it is possible to obtain the inverse kinematic solutions for general cases of considering twist anlges and offsets, the manipulator work space can be designed and enlarged more effciently for specific task. Moreover, in idustrial manipulators, the effect of main three joints is larger than that of the other three joints related to orientation in the view of work space. Therfore the solutions of manin three-joint are considered. Even The inverse kinematic equations are complicatedly coupled, the systematical solving process by using symbolic calculation is presented.

• 제어로봇시스템학회논문지
• /
• 제8권5호
• /
• pp.385-392
• /
• 2002

This paper introduces a new approach to analysis of error convergence for a class of iterative teaming control systems. Firstly, a nonlinear plant is represented using a Takagi-Sugeno(T-S) fuzzy model. Then each iterative learning controller is designed for each linear plant in the T-S fuzzy model. From the view point of two-dimensional(2-D) system theory, we transform the proposed learning systems to a 2-D error equation, which is also established if the form of T-S fuzzy model. We analyze the error convergence in the sense of induced L$_2$-norm, where the effects of disturbances and initial conditions on 2-D error are considered. The iterative teaming controller design problem to guarantee the error convergence can be reduced to the linear matrix inequality problem. This method provides a systematic design procedure for iterative teaming controller. A simulation example is given to illustrate the validity of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.169.3-169
• /
• 2001

This paper introduces a new approach to analysis of error convergence for a class of iterative learning control systems. First, a nonlinear plant is represented using a Takagi-Sugeno(T-S) fuzzy model. Then each iterative learning controller is designed for each linear plant in the T-S fuzzy model. From the view point of two-dimensional(2-D) system theory, we transform the proposed learning systems to a 2-D error equation, which is also established in the form of T-S fuzzy model. We analysis the error convergence in the sense of induced 2 L -norm, where the effects of disturbances and initial conditions on 2-D error are considered. The iterative learning controller design problem to guarantee the error convergence can be reduced to linear matrix inequality problems. In comparison with others, our learning algorithm ...