• Nonlinear Functional Analysis and Applications
• /
• v.27 no.3
• /
• pp.471-497
• /
• 2022

In this paper, we study a system of nonlinear wave equations associated with the helical flows of Maxwell fluid. By constructing a N-order iterative scheme, we prove the local existence and uniqueness of a weak solution. Furthermore, we show that the sequence associated with N-order iterative scheme converges to the unique weak solution at a rate of N-order.

• Korean Journal of Mathematics
• /
• v.13 no.1
• /
• pp.113-122
• /
• 2005

We consider the iterative schemes for the large sparse linear system to solve partial differential equations. Using spectral radius of iteration matrices, the optimal relaxation parameters and good parameters can be obtained. With those parameters we compare the effectiveness of the SOR and SSOR algorithms. Applying Crank-Nicolson approximation, we observe the error distribution according to domain decomposition. The number of processors due to domain decomposition affects time and error. Numerical experiments show that effectiveness of SOR and SSOR can be reversed as time size varies, which is not the usual case. Finally, these phenomena suggest conjectures about equilibrium time grid for SOR and SSOR.

• Kyungpook Mathematical Journal
• /
• v.61 no.2
• /
• pp.279-308
• /
• 2021

The purpose of this paper is to introduce a class of contractive pairs of mappings satisfying a Zamfirescu-type inequality, but controlled with altering distance functions and with parameters satisfying the so-called Geraghty condition in the framework of b-metric spaces. For this class of mappings we prove the existence of points of coincidence, the convergence and stability of the Jungck, Jungck-Mann and Jungck-Ishikawa iterative processes and the existence and uniqueness of its common fixed points.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.141-146
• /
• 2009

In this paper, we introduce a new generalized nonlinear quasivariational inequality and establish its equivalence with a xed point problem by using the resolvent operator technique. Utilizing this equivalence, we suggest two iterative schemes, prove two existence theorems of solutions for the generalized nonlinear quasivariational inequality involving generalized cocoercive mapping and establish some convergence results of the sequences generated by the algorithms. Our results include several previously known results as special cases.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1998.03a
• /
• pp.113-116
• /
• 1998

A derivative based approach to process optimal design in powder forging is presented. The process model, the formulation for process optimal design, and the schemes for the evaluation of the design sensitivity, and an iterative procedure for the optimization are described in detail. The validity of the schemes for the evaluation of the design sensitivity is examined by performing numerical tests. The capability of the proposed approach to deal with diverse process parameters and objective functions is demonstrated through applications to some selected process design problems.

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

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.9 no.4
• /
• pp.390-403
• /
• 2017

Smoothed Particle Hydrodynamics (SPH) method has a good adaptability for the simulation of free surface flow problems. There are two forms of SPH. One is weak compressible SPH and the other one is incompressible SPH (ISPH). Compared with the former one, ISPH method performs better in many cases. ISPH based on Rankine source solution can perform better than traditional ISPH, as it can use larger stepping length by avoiding the second order derivative in pressure Poisson equation. However, ISPH_R method needs to solve the sparse linear matrix for pressure Poisson equation, which is one of the most expensive parts during one time stepping calculation. Iterative methods are normally used for solving Poisson equation with large particle numbers. However, there are many iterative methods available and the question for using which one is still open. In this paper, three iterative methods, CGS, Bi-CGstab and GMRES are compared, which are suitable and typical for large unsymmetrical sparse matrix solutions. According to the numerical tests on different cases, still water test, dam breaking, violent tank sloshing, solitary wave slamming, the GMRES method is more efficient than CGS and Bi-CGstab for ISPH method.

• Korean Journal of Mathematics
• /
• v.25 no.4
• /
• pp.469-481
• /
• 2017

In this paper, we established a general nonconvex split variational inequality problem, this is, an extension of general convex split variational inequality problems in two different Hilbert spaces. By using the concepts of prox-regularity, we proved the convergence of the iterative schemes for the general nonconvex split variational inequality problems. Further, we also discussed the iterative method for the general convex split variational inequality problems.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.417-426
• /
• 2011

This paper is concerned with the existence of monotone positive solutions for a class of nonlinear third-order three-point boundary value problem. By applying iterative techniques, we not only obtain the existence of monotone positive solutions, but also establish iterative schemes for approximating the solutions. An example is also included to illustrate the importance of the results obtained.

• The Pure and Applied Mathematics
• /
• v.25 no.2
• /
• pp.149-160
• /
• 2018

In this paper, we prove a strong convergence result under an iterative scheme for N finite asymptotically $k_i-strictly$ pseudo-contractive mappings and a firmly nonexpansive mappings $S_r$. Then, we modify this algorithm to obtain a strong convergence result by hybrid methods. Our results extend and unify the corresponding ones in [1, 2, 3, 8]. In particular, some necessary and sufficient conditions for strong convergence under Algorithm 1.1 are obtained.