• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.183-191
• /
• 2007

In this paper, we introduce and study a new class of equilibrium problems, known as regularized mixed quasi equilibrium problems. We use the auxiliary principle technique to suggest and analyze some iterative schemes for regularized equilibrium problems. We prove that the convergence of these iterative methods requires either pseudomonotonicity or partially relaxed strongly monotonicity. Our proofs of convergence are very simple. As special cases, we obtain earlier results for solving equilibrium problems and variational inequalities involving the convex sets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.815-820
• /
• 2012

We introduce two-dimensional soft output Viterbi algorithm (2D SOVA) and iterative 2D SOVA for holographic data storage. Since the holographic data storage is 2D intersymbol interference (ISI) channel, the 2D detection schemes have good performance at holographic data storage. The 2D SOVA and iterative 2D SOVA are 2D detection schemes. We introduce and compare the two 2D detection schemes. The 2D SOVA is approximately 2 dB better than one-dimensional (1D) detection scheme, and iterative 2D SOVA is approximately 1 dB better than the 2D SOVA. In contrast, the iterative 2D SOVA is approximately twice complex higher than 2D SOVA, and 2D SOVA is approximately twice complex higher than 1D detection scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.11
• /
• pp.12-20
• /
• 2002

Serially concatenated multilevel coded modulation (SCMCM) is proposed in this paper. It is a combined scheme of the outer convolutional code and inner multilevel coded modulation (MCM) which is bandwidth-efficient coded modulation. And the performance of three schemes for decoding of the proposed SCMCM is compared and analyzed. As results of simulations, global iterative decoding with inner and outer code should be performed to improve the error performance as the number of iterations is increased. And the scheme which uses both local iterative multistage decoding in MCM and global iterative decoding with inner and outer code, called Scheme 3 in this paper, shows the best error performance among the three schemes considered in this paper. In addition, performance difference between this scheme and the others is increased as the signal to noise ratio (SNR) is increased. Therefore, Scheme 3 is considered to be the proper decoding scheme of SCMCM.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.421-424
• /
• 1990

An iterative learning control scheme for exact-tracking control and parameter estimation of uncertain robotic systems is presented. In the learning control structure, tracking and feedforward input converge globally and asymptotically as iteration increases. Since convergence of parameter errors depends only on the persistent exciting condition of system trajectories along the iteration independently of length of trajectories, it may be achieved with only system trajectories of small duration. In addition, these learning control schemes are expected to be effectively applicable to time-varying parametric systems as well as time-invariant systems, for the parameter estimation is performed at each fixed time along the iteration. Finally, no usage of acceleration signal and no in version of estimated inertia matrix in the parameter estimator makes these learning control schemes more feasible.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.78-83
• /
• 2000

An iterative time marching procedure for solving incompressible internal flow has been applied to the flow around a rotor-stator. This procedure solves three-dimensional incompressible Reynolds-averaged Navier-Stokes equation on a moving, time-deforming, non-orthogonal body-fitted grid using second-order accurate schemes for the time derivatives and third/second-order accurate schemes for the spatial derivatives. To handle rotationg geometry, the multiblock technique is applied and the overall flow domain is subdivided into two blocks. In each block, a grid is generated and flowfield is solved independently of the other blocks. The boundary data for each block is provided by the neighboring blocks using bilinear interpolation technique.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.4
• /
• pp.427-438
• /
• 1991

An iterative learning control scheme for exact-tracking control and parameter estimation of uncertain robotic system is preented. In the learning control structure, the control input converges globally and asymtotically to the desired input as iteration increases. Since convergence of parameter errors depends only on the persistent exciting condition of system trajectories along the iteration independently of the time-duration of trajectories, it may be achieved with system trajectories with small duration. In addition, the proposd learning control schemes are applicable to time-varying parametric systems as well as time-invariant systems, because the parameter estimation is performed at each fixed time along the iteration. In the parameter estimator, the acceleration information as well as the inversion of estimated inertia matrix are not used at all, which makes the proposed learning control schemes more feasible.

• Nuclear Engineering and Technology
• /
• v.53 no.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.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.961-967
• /
• 2014

Raptor codes are a class of rateless codes originally designed for binary erasure channels. This paper presents a compact set of mathematical expressions for iterative soft decoding of raptor codes. In addition, an early termination scheme is employed, and it is embedded in a single algorithm with the formula. In the proposed algorithm, the performance is enhanced by adopting iterative decoding, both in each inner and outer code and in the concatenated code itself between the inner and outer codes. At the same time, the complexity is reduced by applying an efficient early termination scheme. Simulation results show that our proposed method can achieve better performance with reduced decoding complexity compared to the conventional schemes.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.25-38
• /
• 2010

In this paper, we introduce a hybrid iterative method for finding a common element of the set of solutions of a mixed equilibrium problem, the set of common mixed points of finitely many nonexpansive mappings and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. We show that the iterative sequences converge strongly to a common element of the three sets. The results extended and improved the corresponding results of L.-C.Ceng and J.-C.Yao.

• The Pure and Applied Mathematics
• /
• v.20 no.4
• /
• pp.277-286
• /
• 2013

In this paper, we suggest and analyze a family of multi-step iterative methods which do not involve the high-order differentials of the function for solving nonlinear equations using a different type of decomposition (mainly due to Noor and Noor [15]). We also discuss the convergence of the new proposed methods. Several numerical examples are given to illustrate the efficiency and the performance of the new iterative method. Our results can be considered as an improvement and refinement of the previous results.