• MALSORI
• /
• no.48
• /
• pp.117-126
• /
• 2003

source of speech signal is actually composed of combination of periodic and aperiodic components, although it is often modeled to either one of those. In the paper an experiment which can separate periodic and aperiodic components from speech source. Linear predictive residual signal was used as a approximated vocal source the original speech to obtain the estimated aperiodic part. Iterative extrapolation method was used to compute the aperiodic part.

• Korean Journal of Mathematics
• /
• v.21 no.3
• /
• pp.213-222
• /
• 2013

In this paper, we introduce and consider a new system of generalized variational inequalities involving five different operators. Using the sunny nonexpansive retraction technique we suggest and analyze some new explicit iterative methods for this system of variational inequalities. We also study the convergence analysis of the new iterative method under certain mild conditions. Our results can be viewed as a refinement and improvement of the previously known results for variational inequalities.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.409-425
• /
• 2015

In this paper, a new iterative scheme based on the extra-gradient-like method for finding a common element of the set of fixed points of a finite family of nonexpansive mappings and the set of solutions of modified variational inequalities in Banach spaces. A strong convergence theorem for this iterative scheme in Banach spaces is established. Our results extend recent results announced by many others.

• Journal of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.209-227
• /
• 1999

We propose new parallel block ILU (Incomplete LU) factorization preconditioners for a nonsymmetric block-tridiagonal M-matrix. Theoretial properties of these block preconditioners are studied to see the convergence rate of the preconditioned iterative methods, Lastly, numerical results of the right preconditioned GMRES and BiCGSTAB methods using the block ILU preconditioners are compared with those of these two iterative methods using a standard ILU preconditioner to see the effectiveness of the block ILU preconditioners.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.230-235
• /
• 1992

We propose a method of generating data to train a neural network controller. The data can be prepared directly by an iterative learning technique which repeatedly adjusts the control input to improve the tracking quality of the desired trajectory. Instead of storing control input data in memory as in iterative learning control, the neural network stores the mapping between the control input and the desired output. We apply this concept to the trajectory control of a two link robot manipulator with a feedforward neural network controller and a feedback linear controller. Simulation results show good generalization of the neural network controller.

• East Asian mathematical journal
• /
• v.17 no.2
• /
• pp.265-273
• /
• 2001

In this paper, we prove that under certain conditions the Ishikawa iterative method with errors converges strongly to the unique solution of the nonlinear strongly accretive operator equation Tx=f. Related results deal with the solution of the equation x+Tx=f. Our results extend and improve the corresponding results of Liu, Childume, Childume-Osilike, Tan-Xu, Deng, Deng-Ding and others.

• Communications of the Korean Mathematical Society
• /
• v.25 no.3
• /
• pp.419-426
• /
• 2010

In this paper, a three-step iterative method is considered for finding a common element in the set of fixed points of a non-expansive mapping and in the set of solutions of a variational inclusion problem in a real Hilbert space.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.931-934
• /
• 2013

The weight calculation in an iterative algorithm is the most computationally costly task in computed tomography image reconstruction. In this letter, a fast algorithm to speed up the weight calculation is proposed. The classic square pixel rotation approximate calculation method for computing the weights in the iterative algorithm is first analyzed and then improved by replacing the square pixel model with a circular pixel model and the square rotation approximation with a segmentation method of a circular area. Software simulation and hardware implementation results show that our proposed scheme can not only improve the definition of the reconstructed image but also accelerate the reconstruction.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.342-349
• /
• 2008

A selection method of primary degrees of freedom in dynamic condensation for nonproportional damping structures is proposed. Recently, many dynamic condensation schemes for complex eigenanalysis have been applied to reduce the number of degrees of freedom. Among them, iterative scheme is widely used because accurate eigenproperties can be obtained by updating the transformation matrix in every iteration. However, a number of iteration to enhance the accuracy of the eigensolutions may have a possibility to make the computation cost expensive. This burden can be alleviated by applying properly selected primary degrees of freedom. In this study, which method for selection of primary degrees of freedom is best fit for the iterative dynamic condensation scheme is presented through the results of a numerical experiment. The results of eigenanalysis of the proposed method is also compared to those of other selection schemes to discuss a computational effectiveness.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.7
• /
• pp.355-362
• /
• 2003

The fault analysis problem of a distribution network has many difficulties comes from the unbalance of loads or networks and the lacks of load information. The unbalance of loads or networks make the fault location difficult when it use the classical sequence transformation. Moreover the amount of load in the distribution networks fluctuates with time. This paper introduces a recent fault location algorithm using iterative method which handle the unbalance of the problem. But, the fault location errors comes from the load fluctuations still left. For the real application of the new fault location algorithm in distribution networks, this paper studied the effect of the load fluctuations in the algorithm.