• Journal of applied mathematics & informatics
• /
• v.28 no.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.

• Journal of the Korean Data and Information Science Society
• /
• v.9 no.2
• /
• pp.219-225
• /
• 1998

The parameters in linear models with censored normal responses are usually estimated by the iterative maximum likelihood and least square methods. However, the iterative least square method is simple but hardly has theoretical justification, and the iterative maximum likelihood estimating equations are complicatedly derived. In this paper, we justify these methods via Wedderburn (1974)'s quasi-likelihood approach. This provides an explicit justification for the iterative least square method and also directly the iterative maximum likelihood method for estimating the regression coefficients.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.341-378
• /
• 1997

We consider three classes of numerical methods for solv-ing the semi-explicit differential-algebraic equations of index 1 and higher. These methods use implicit multistep fixed stepsize methods and several iterative processes including simple iteration, full a2nd modified Newton iteration. For these methods we prove convergence theorems and derive error estimates. We consider different ways of choosing initial approximations for these iterative methods and in-vestigate their efficiency in theory and practice.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.1-16
• /
• 1997

In this paper we study efficient parallel implementation for hybrid iterative methods BICGSTAB and BICGSTAB $(\ell)$ with ${Well}=2$ on the CRAY C90 and the efficiency of their parallel performance is evaluated. numerical experiments suggest that on the CRAY C90 a parallel inner product algorithm called PDOTB be used for the par-allelization of hybrid iterative methods containing sensitive values of inner products. Lastly it is shown that the number of iterations in which parallel hybrid iterative methods satisfy a certain convergence criterion depends on the number of processors to be used.

• Journal of Applied and Pure Mathematics
• /
• v.6 no.3_4
• /
• pp.177-189
• /
• 2024

In this paper, we suggest and analyze new higher order classes of iterative methods for solving nonlinear equations by using variational iteration technique. We present several examples to illustrate the efficiency of the proposed methods. Comparison with other similar methods is also given. New methods can be considered as an alternative of the existing methods. This technique can be used to suggest a wide class of new iterative methods for solving nonlinear equations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.798-809
• /
• 2013

In this paper, we propose robust relay and destination filter design methods for the multi-user peer-to-peer amplify-and-forward relaying systems while taking imperfect channel knowledge into consideration. Specifically, the relay and destination filter sets are developed to minimize the sum mean-squared-error (MSE). We first present a robust joint optimum relay and destination filter calculation method with an iterative algorithm. Motivated by the need to reduce computational complexity of the iterative scheme, we then formulate a simplified sum MSE minimization problem using the relay filter decomposability, which lead to two robust sub-optimum non-iterative design methods. Finally, we propose robust modified destination filter design methods which require only local channel state information between relay node and a specific destination node. The analysis and simulation results verify that, compared with the optimum iterative method, the proposed non-iterative schemes suffer a marginal loss in performance while enjoying significantly improved implementation efficiencies. Also it is confirmed that the proposed robust filter design methods provide desired robustness in the presence of channel uncertainty.

• Ocean Science Journal
• /
• v.41 no.4
• /
• pp.195-199
• /
• 2006

Comparative study was carried out for an acoustic iterative inverse method to estimate bubble size distributions in water. Conventional bubble sizing methods consider only sound attenuation for sizing. Choi and Yoon [IEEE, 26(1), 125-130 (2001)] reported an acoustic iterative inverse method, which extracts the sound speed component from the measured sound attenuation. It can more accurately estimate the bubble size distributions in water than do the conventional methods. The estimation results of acoustic iterative inverse method were compared with other experimental data. The experimental data show good agreement with the estimation from the acoustic iterative inverse method. This iterative technique can be utilized for bubble sizing in the ocean.

• Korean Journal of Mathematics
• /
• v.24 no.1
• /
• pp.51-63
• /
• 2016

In this works, we consider a class of regularized equilibrium problems in Banach spaces. By using the auxiliary principle techniques to suggest some iterative schemes for regularized equilibrium problems and proved the convergence of these iterative methods required either pseudoaccretivity or partially relaxed strongly accretivity.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.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.

• Proceedings of the KSR Conference
• /
• 2000.05a
• /
• pp.78-85
• /
• 2000

Computer algorithms for the loadflow of the DC traction power supply system are examined. Algorithms to solve the nodal equation are reviewed and the two iterative methods to solve the nonlinear nature of the loadflow are analyzed and tested, which are so called conductance matrix method and current vector iterative mettled. The result of the analysis tells that the current vector iterative method makes faster convergency and needs less computing time, and it is verified by the test running of the programs based on each of the iterative methods.