• Korean Journal of Mathematics
• /
• v.28 no.4
• /
• pp.915-929
• /
• 2020

We prove a fixed point theorem for generalized asymptotic pointwise nonexpansive mapping in the setting of a hyperbolic space. A one-step iterative scheme approximating common fixed point of two generalized asymptotic pointwise (quasi-) nonexpansive mappings in this setting is provided. We obtain ∆-convergence and strong convergence theorems of the iterative scheme for two generalized asymptotic pointwise nonexpansive mappings in the same setting. Our results generalize and extend some related results in the literature.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.667-674
• /
• 2009

In this paper, a new one-step iterative scheme with error for approximating common fixed points of asymptotically quasi-nonexpansive type nonself-mappings in Banach space is defined. The results obtained in this paper extend and improve the recent ones, announced by H. Y. Zhou, Y. J. Cho, and S. M. Kang [Zhou et al.,(2007), namely, A new iterative algorithm for approximating common fixed points for asymptotically non-expansive mappings, published to Fixed Point Theory and Applications 2007 : 1-9], and many others.

• East Asian mathematical journal
• /
• v.26 no.3
• /
• pp.429-440
• /
• 2010

In this paper, we study a new one-step iterative scheme with error for approximating common fixed points of non-self asymptotically nonexpansive in the intermediate sense mappings in uniformly convex Banach spaces. Also we have proved weak and strong convergence theorems for above said scheme. The results obtained in this paper extend and improve the recent ones, announced by Zhou et al. [27] and many others.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.339-345
• /
• 2015

In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3-4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1067-1082
• /
• 2022

This paper presents a new optimal three-step eighth-order family of iterative methods for finding multiple roots of nonlinear equations. Different from the all existing optimal methods of the eighth-order, the new iterative scheme is constructed using one function and three derivative evaluations per iteration, preserving the efficiency and optimality in the sense of Kung-Traub's conjecture. Theoretical results are verified through several standard numerical test examples. The basins of attraction for several polynomials are also given to illustrate the dynamical behaviour and the obtained results show better stability compared to the recently developed optimal methods.

• International Journal of CAD/CAM
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2013

Just by adjusting the control points iteratively, progressive iterative approximation (PIA) presents an intuitive and straightforward scheme such that the resulting limit curve (surface) can interpolate the original data points. In order to obtain more flexibility, adjusting only a subset of the control points, a new method called local progressive iterative approximation (LPIA) has also been proposed. But to this day, there are two problems about PIA and LPIA: (1) Only an approximation process is discussed, but the accurate convergence curves (surfaces) are not given. (2) In order to obtain an interpolating curve (surface) with high accuracy, recursion computations are needed time after time, which result in a large workload. To overcome these limitations, this paper gives an explicit matrix expression of the control points of the limit curve (surface) by the PIA or LPIA method, and proves that the column vector consisting of the control points of the PIA's limit curve (or surface) can be obtained by multiplying the column vector consisting of the original data points on the left by the inverse matrix of the collocation matrix (or the Kronecker product of the collocation matrices in two direction) of the blending basis at the parametric values chosen by the original data points. Analogously, the control points of the LPIA's limit curve (or surface) can also be calculated by one-step. Furthermore, the $G^1$ joining conditions between two adjacent limit curves obtained from two neighboring data points sets are derived. Finally, a simple LPIA method is given to make the given tangential conditions at the endpoints can be satisfied by the limit curve.

• Coupled systems mechanics
• /
• v.1 no.4
• /
• pp.325-343
• /
• 2012

We present different numerical methods for solving the shallow shelf equations with basal drag (SSAB). An alternative approach of splitting the SSAB equation into a Laplacian and diagonal shift operator is discussed with respect to the underlying eigenvalue problem. First, we solve the equations using standard methods. Then, the coupled equations are decomposed into operators for membranes stresses, basal shear stress and driving stress. Applying reasonable parameter values, we demonstrate that the operator of the membrane stresses is much stiffer than the operator of the basal shear stress. Here, we could apply a new splitting method, which alternates between the iteration on the membrane-stress operator and the basal-shear operator, with a more frequent iteration on the operator of the membrane stresses. We show that this splitting accelerates and stabilize the computational performance of the numerical method, although an appropriate choice of the standard method used to solve for all operators in one step speeds up the scheme as well.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.2
• /
• pp.182-191
• /
• 2001

The paper describes the improvement on concurrent subspace optimization(CSSO) via automatic differentiation. CSSO is an efficient strategy to coupled multidisciplinary design optimization(MDO), wherein the original design problem is non-hierarchically decomposed into a set of smaller, more tractable subspaces. Key elements in CSSO are consisted of global sensitivity equation, subspace optimization, optimum sensitivity analysis, and coordination optimization problem that require frequent use of 1st order derivatives to obtain design sensitivity information. The current version of CSSO adopts automatic differentiation scheme to provide a robust sensitivity solution. Automatic differentiation has numerical effectiveness over finite difference schemes tat require the perturbed finite step size in design variable. ADIFOR(Automatic Differentiation In FORtran) is employed to evaluate sensitivities in the present work. The use of exact function derivatives facilitates to enhance the numerical accuracy during the iterative design process. The paper discusses how much the automatic differentiation based approach contributes design performance, compared with traditional all-in-one(non-decomposed) and finite difference based approaches.

• Journal of Korean Society of Steel Construction
• /
• v.20 no.1
• /
• pp.151-163
• /
• 2008

A formulation of three-dimensional model of articulated train-b ridge dynamic interaction has been made for the Korean eXpress Train (KTX). Semi-periodic profiles of rail irregularities consisting of elevation, alignment, cross and gauge irregularities have also been proposed using FRA maximum tolerable rail deviations. The effects of rail joints and sleeper step were also included. The resulting system matrices of train and bridge are very spare, and thus, are stored in one-dimensional arrays, yielding a time-efficient solution. A numerical algorithm for computing bridge-train response including an iterative scheme is also formulated. A program simulating train-bridge interaction and solving this problem using the new algorithm is implemented as new modules for the f inite element analysis software named XFINAS. Computed results using the new program are then checked by that of the validated 2-D bridge-train interaction model. This new 3D analysis provides more detailed train responses such as swaying, bouncing, rolling, pitching and yawing accelerations, which are useful inevaluating passenger riding comfort. Train operation safety and derailment could also be directly investigated by relative wheel displacements computed from this program.