• Title/Summary/Keyword: three-step iterative method

Search Result 37, Processing Time 0.023 seconds

A GENERAL FORM OF MULTI-STEP ITERATIVE METHODS FOR NONLINEAR EQUATIONS

  • Oh, Se-Young;Yun, Jae-Heon
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.773-781
    • /
    • 2010
  • Recently, Yun [8] proposed a new three-step iterative method with the fourth-order convergence for solving nonlinear equations. By using his ideas, we develop a general form of multi-step iterative methods with higher order convergence for solving nonlinear equations, and then we study convergence analysis of the multi-step iterative methods. Lastly, some numerical experiments are given to illustrate the performance of the multi-step iterative methods.

A Comparative Study of PISO, SIMPLE, SIMPLE-C Algorithms in 3-dimensional Generalized Coordinate Systems (3차원 일반 좌표계에서의 PISO, SIMPLE, SIMPLE-C 알고리즘의 비교)

  • Park J. Y.;Baek J. H.
    • Journal of computational fluids engineering
    • /
    • v.1 no.1
    • /
    • pp.26-34
    • /
    • 1996
  • The performance of the SIMPLE, SIMPLE-C and PISO algorithms for the treatment of the pressure-velocity coupling in fluid flow problems were examined by comparing the computational effort required to obtain the same level of the convergence. Example problems are circular duct and 90-degree bent square-duct. For circular duct case, laminar and turbulent flow were computed. For 90-degree bent square-duct case, laminar flow was simulated by the time-marching method as well as the iterative method. The convergence speed of the other two algorithms are not always superior to SIMPLE algorithm. SIMPLE algorithm is faster than SIMPLE-C algorithm in the simple laminar flow calculations. The application of the PISO algorithm in three dimensional general coordinates is not so effective as in two-dimensional ones. Since computational time of PISO algorithm is increased at each time step(or iterative step) in three dimension, the total convergence speed is not decreased. But PISO algorithm is stable for large time step by using time marching method,.

  • PDF

Three-Dimensional Grid Generation Method for an Orthogonal Grid at the Boundary by Using Boundary Element Method (경계요소법을 이용한 경계에 직교하는 삼차원 격자형성법)

  • Jeong H. K.;Kwon J. H.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.82-89
    • /
    • 1995
  • In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

  • PDF

AN EFFICIENT THIRD ORDER MANN-LIKE FIXED POINT SCHEME

  • Pravin, Singh;Virath, Singh;Shivani, Singh
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.4
    • /
    • pp.785-795
    • /
    • 2022
  • In this paper, we introduce a Mann-like three step iteration method and show that it can be used to approximate the fixed point of a weak contraction mapping. Furthermore, we prove that this scheme is equivalent to the Mann iterative scheme. A comparison is made with the other third order iterative methods. Results are presented in a table to support our conclusion.

APPROXIMATION RESULTS OF A THREE STEP ITERATION METHOD IN BANACH SPACE

  • Omprakash Sahu;Amitabh Banerjee
    • Korean Journal of Mathematics
    • /
    • v.31 no.3
    • /
    • pp.269-294
    • /
    • 2023
  • The purpose of this paper is to introduce a new three-step iterative process and show that our iteration scheme is faster than other existing iteration schemes in the literature. We provide a numerical example supported by graphs and tables to validate our proofs. We also prove convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some weak and strong convergence theorems for nonexpansive mappings.

A Camera Calibration Method using Several Images for Three Dimensional Measurement (여러 장의 영상을 사용하는 3차원 계측용 카메라 교정방법)

  • Kang, Dong-Joong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.3
    • /
    • pp.224-229
    • /
    • 2007
  • This paper presents a camera calibration method using several images for three dimensional measurement applications such as stereo systems, mobile robots, and visual inspection systems in factories. Conventional calibration methods that use single image suffer from errors related to reference point extraction in image, lens distortion, and numerical analysis of nonlinear optimization. The camera parameter values obtained from images of same camera is not same even though we use same calibration method. The camera parameters that are obtained from several images of different view for a calibration target is usaully not same with large error values and we can not assume a special probabilistic distribution when we estimate the parameter values. In this paper, the median value of camera parameters from several images is used to improve estimation of the camera values in an iterative step with nonlinear optimization. The proposed method is proved by experiments using real images.

Investigation of nonlinear free vibration of FG-CNTRC cylindrical panels resting on elastic foundation

  • J.R. Cho
    • Structural Engineering and Mechanics
    • /
    • v.88 no.5
    • /
    • pp.439-449
    • /
    • 2023
  • Non-linear vibration characteristics of functionally graded CNT-reinforced composite (FG-CNTRC) cylindrical shell panel on elastic foundation have not been sufficiently examined. In this situation, this study aims at the profound numerical investigation of the non-linear vibration response of FG-CNTRC cylindrical panels on Winkler-Pasternak foundation by introducing an accurate and effective 2-D meshfree-based non-linear numerical method. The large-amplitude free vibration problem is formulated according to the first-order shear deformation theory (FSDT) with the von Karman non-linearity, and it is approximated by Laplace interpolation functions in 2-D natural element method (NEM) and a non-linear partial derivative operator HNL. The complex and painstaking numerical derivation on the curved surface and the crucial shear locking are overcome by adopting the geometry transformation and the MITC3+ shell elements. The derived nonlinear modal equations are iteratively solved by introducing a three-step iterative solving technique which is combined with Lanczos transformation and Jacobi iteration. The developed non-linear numerical method is estimated through the benchmark test, and the effects of foundation stiffness, CNT volume fraction and functionally graded pattern, panel dimensions and boundary condition on the non-linear vibration of FG-CNTRC cylindrical panels on elastic foundation are parametrically investigated.

Modeling Approaches for Dynamic Robust Design Experiment

  • Bae, Suk-Joo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.373-376
    • /
    • 2006
  • In general, there are three kinds of methods in analyzing dynamic robust design experiment: loss model approach, response function approach, and response model approach. In this talk, we review the three modeling approaches in terms of several criteria in comparison. This talk also generalizes the response model approach based on a generalized linear model. We develop a generalized two-step optimization procedure to substantially reduce the process variance by dampening the effect of both explicit and hidden noise variables. The proposed method provides more reliable results through iterative modeling of the residuals from the fitted response model. The method is compared with three existing approaches in practical examples.

  • PDF

WEAK AND STRONG CONVERGENCE OF SUBGRADIENT EXTRAGRADIENT METHODS FOR PSEUDOMONOTONE EQUILIBRIUM PROBLEMS

  • Hieu, Dang Van
    • Communications of the Korean Mathematical Society
    • /
    • v.31 no.4
    • /
    • pp.879-893
    • /
    • 2016
  • In this paper, we introduce three subgradient extragradient algorithms for solving pseudomonotone equilibrium problems. The paper originates from the subgradient extragradient algorithm for variational inequalities and the extragradient method for pseudomonotone equilibrium problems in which we have to solve two optimization programs onto feasible set. The main idea of the proposed algorithms is that at every iterative step, we have replaced the second optimization program by that one on a specific half-space which can be performed more easily. The weakly and strongly convergent theorems are established under widely used assumptions for bifunctions.