• The Journal of the Acoustical Society of Korea
• /
• v.15 no.4E
• /
• pp.9-13
• /
• 1996

We developed an iterative algorithm which could improve the resolution of reconstructed tomograms having random attenuation patterns and analyzed the limitation of this algorithm. The simple back-and forth propagation algorithm has depth resolution about four wavelengths. An iterative algorithm, based on back-and-forth propagation, can be used to improve the resolution of reconstructed tomograms. We analyzed the wavefield for multi-layered specimen and programmed iterative algorithm using Clanguage. Simulation results show that the images get clearer as the number of iterations increases. Also, unambiguous images can be reconstructed using this algorithm even when the layer separation is only two wavelengths. However, this iteration algorithm comes up with an incorrect solution for the number of projections less than five.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.13-31
• /
• 2015

In this paper, we introduce a general iterative algorithm for finding a common element of the common fixed point set of an infinite family of ${\lambda}_i$-strict pseudo-contractions and the solution set of a general system of variational inclusions for two inverse strongly accretive operators in q-uniformly smooth Banach spaces. Then, we analyze the strong convergence of the iterative sequence generated by the proposed iterative algorithm under mild conditions.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1323-1339
• /
• 2008

In this paper, a new class of $(h,{\eta})$-proximal for proper functionals in Hilbert spaces is introduced. The existence and Lip-schitz continuity of the $(h,{\eta})$-proximal mappings for proper functionals are proved. A class of generalized nonlinear quasi-variational-like inclusions in Hilbert spaces is introduced. A perturbed three-step iterative algorithm with errors for the generalized nonlinear quasi-variational-like inclusion is suggested. The existence and uniqueness theorems of solution for the generalized nonlinear quasi-variational-like inclusion are established. The convergence and stability results of iterative sequence generated by the perturbed three-step iterative algorithm with errors are discussed.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.399-409
• /
• 2007

In this paper we use iterative dynamic programming in the discrete case to solve a wide range of the nonlinear equations systems. First, by defining an error function, we transform the problem to an optimal control problem in discrete case. In using iterative dynamic programming to solve optimal control problems up to now, we have broken up the problem into a number of stages and assumed that the performance index could always be expressed explicitly in terms of the state variables at the last stage. This provided a scheme where we could proceed backwards in a systematic way, carrying out optimization at each stage. Suppose that the performance index can not be expressed in terms of the variables at the last stage only. In other words, suppose the performance index is also a function of controls and variables at the other stages. Then we have a nonseparable optimal control problem. Furthermore, we obtain the path from the initial point up to the approximate solution.

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

• Coupled systems mechanics
• /
• v.7 no.6
• /
• pp.755-774
• /
• 2018

The Ritz method is known as very successful strategy for discretizing continuous problems, but it has never been used for solving systems of algebraic equations. The Iterated Ritz Method (IRM) is a novel iterative solver based on the discretized Ritz procedure applied at each iteration step. With an appropriate choice of coordinate vectors, the method may be efficient in linear, nonlinear and optimization problems. Additionally, some iterative methods can be explained as special cases of this approach, which helps to understand advantages and limitations of these methods and gives motivation for their improvement in sense of IRM. In this paper, some ideas for generation of efficient coordinate vectors are presented. The algorithm was developed and tested independently and then implemented into the open source program FEAP. Method has been successfully applied to displacement based (even ill-conditioned) models of structural engineering practice. With this original approach, a new iterative solution strategy has been opened.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.205-235
• /
• 2023

In this paper, we introduce and study an iterative technique for solving quasimonotone split variational inequality problems and fixed point problem in the framework of real Hilbert spaces. Our proposed iterative technique is self adaptive, and easy to implement. We establish that the proposed iterative technique converges strongly to a minimum-norm solution of the problem and give some numerical illustrations in comparison with other methods in the literature to support our strong convergence result.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.881-894
• /
• 2022

In this paper, we consider a class of random generalized nonlinear mixed variational inclusions with random fuzzy mappings and random relaxed cocoercive mappings in real Hilbert spaces. We suggest and analyze an iterative algorithm for finding the approximate solution of this class of inclusions. Further, we discuss the convergence analysis of the iterative algorithm under some appropriate conditions. Our results can be viewed as a refinement and improvement of some known results in the literature.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.211-230
• /
• 2008

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.7 s.337
• /
• pp.27-34
• /
• 2005

Iterative detection (ID) has proven to be a near-optimal solution for concatenated Finite State Machines (FSMs) with interleavers over an additive white Gaussian noise (AWGN) channel. When perfect channel state information (CSI) is not available at the receiver, an adaptive ID (AID) scheme is required to deal with the unknown, and possibly time-varying parameters. The basic building block for ID or AID is the soft-input soft-output (SISO) or adaptive SISO (A-SISO) module. In this paper, Reduced State SISO (RS-SISO) algorithms have been applied for complexity reduction of the A-SISO module. We show that serially concatenated CPM (SCCPM) with AID has turbo-like performance over fading ISI channels and also RS-A-SISO systems have large iteration gains. Various design options for RS-A-SISO algorithms are evaluated. Recently developed density evolution technique is used to analyze RS-A-SISO algorithms. We show that density evolution technique that is usually used for AWGN systems is also a good analysis tool for RS-A-SISO systems over frequency-selective fading channels.