• Korean Journal of Mathematics
• /
• 제28권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
• /
• 제49권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
• /
• 제26권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
• /
• 제17권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.

• 대한수학회지
• /
• 제59권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
• /
• 제13권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
• /
• 제1권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.

• 대한기계학회논문집A
• /
• 제25권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.

• 한국강구조학회 논문집
• /
• 제20권1호
• /
• pp.151-163
• /
• 2008

본 논문에는 KTX (Korean eXpres Train)을 위한 3차원 관절대차의 차량-교량 동적 상호작용의 해석모델의 공식이 제안되었다. 궤도틀림의 반주기적 파형이 FRA의 레일틀림 최대허용기준을 사용하여 제안되었고, 레일 이음매와 침목의 간격 또한 포함되었다. 궤도틀림은 수준, 구배, 수평 및 궤간틀림을 포함하고 있다. 결과적으로 나타나는 차량-교량 시스템 행렬은 매우 적은 요소를 포함하기 때문에 1차원의 배열에 저장할 수 있으며, 시간절약적인 해법을 창출한다. 반복기법을 포함하는 차량-교량 작용 계산의 수치적 알고리즘 또한 공식화하였으며, 차량-교량 상호작용을 모사하고 새로운 알고리즘에 의해서 이 문제를 풀기 위한 프로그램이 'XFINAS'라고 불리는 프로그램에 모듈로서 내포되었다. 새로운 프로그램에 의해서 계산된 결과가 검증된 2차원의 차량-교량 상호작용 모델의 결과에 의해서 검증되었다. 본 연구에서 제시한 3차원 해석은 차량의 보다 상세한 응답을 제공한다. 예를 들면, 회전운동-롤링, 요잉 및 피칭- 및 수평 및 수직운동에 대한 가속도를 제공할 수 있으며, 이러한 응답은 승객의 승차감 평가에 유용한 자료로 활용될 수 있다. 차량의 안정성과 차륜의 탈선 또한 본 프로그램에서 계산되는 차륜의 상대변위를 이용하여 직접적으로 계산이 가능하다.