• Title/Summary/Keyword: numerical iteration

Search Result 450, Processing Time 0.021 seconds

NUMERICAL ANALYSIS OF CHORDS SUMMATION ALGORITHM FOR π VALUE

  • PARK, HYUN IL;PAHADIA, SAURAV;HWANG, CHRISTINE;HWANG, CHI-OK
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.3_4
    • /
    • pp.277-290
    • /
    • 2020
  • We propose and analyze a chord summation algorithm, which combines the ideas of Viète and Archimedes to calculate the value of π. The error of the algorithm decreases exponentially per iteration and becomes pinched at a critical iteration, depending on the accuracy of the first input value, ${\sqrt{2}}$. The critical iteration is also analyzed.

The Characteristics of Koch Island Microstrip Patch Antenna

  • Kim, Il-Kwon;Yook, Jong-Gwan;Park, Han-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3A
    • /
    • pp.166-170
    • /
    • 2003
  • In this paper, the characteristics of Koch island microstrip patch antenna are investigated by numerical and experimental methods. The Koch patch is fractal shaped antenna which can be characterized by two properties such as space-filling and self-similarity. Due to its space-filling property of fractal structure, the proposed Koch fractal patch antennas are smaller in size than that of conventional square patch antenna. From numerical and experimental results, it is found that as the iteration number and iteration factor of Koch patch increase, its resonance frequency becomes lower than that of conventional patch, thus contributes to antenna size reduction. In particular, when the fractal iteration factor is 1/4, the fractal antenna is 45% smaller in size than that of conventional patch, while maintaining radiation patterns comparable to those of rectangular antenna and cross polarization level is about -20~-14 dB.

Exact solutions to the boundary value problems by VIM

  • Jang, Bong-Soo
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.4
    • /
    • pp.1371-1377
    • /
    • 2008
  • In this paper, we have employed the variational iteration method to solve the boundary value problems. Numerical results reveal that it is a very effective method compared with the results obtained by using the Adomian decomposition method in Wazwaz, A. M. (2000).

  • PDF

Efficient MCS for random vibration of hysteretic systems by an explicit iteration approach

  • Su, Cheng;Huang, Huan;Ma, Haitao;Xu, Rui
    • Earthquakes and Structures
    • /
    • v.7 no.2
    • /
    • pp.119-139
    • /
    • 2014
  • A new method is proposed for random vibration anaylsis of hysteretic systems subjected to non-stationary random excitations. With the Bouc-Wen model, motion equations of hysteretic systems are first transformed into quasi-linear equations by applying the concept of equivalent excitations and decoupling of the real and hysteretic displacements, and the derived equation system can be solved by either the precise time integration or the Newmark-${\beta}$ integration method. Combining the numerical solution of the auxiliary differential equation for hysteretic displacements, an explicit iteration algorithm is then developed for the dynamic response analysis of hysteretic systems. Because the computational cost for a large number of deterministic analyses of hysteretic systems can be significantly reduced, Monte-Carlo simulation using the explicit iteration algorithm is now viable, and statistical characteristics of the non-stationary random responses of a hysteretic system can be obtained. Numerical examples are presented to show the accuracy and efficiency of the present approach.

Convergence analysis of fixed-point iteration with Anderson Acceleration on a simplified neutronics/thermal-hydraulics system

  • Lee, Jaejin;Joo, Han Gyu
    • Nuclear Engineering and Technology
    • /
    • v.54 no.2
    • /
    • pp.532-545
    • /
    • 2022
  • In-depth convergence analyses for neutronics/thermal-hydraulics (T/H) coupled calculations are performed to investigate the performance of nonlinear methods based on the Fixed-Point Iteration (FPI). A simplified neutronics-T/H coupled system consisting of a single fuel pin is derived to provide a testbed. The xenon equilibrium model is considered to investigate its impact during the nonlinear iteration. A problem set is organized to have a thousand different fuel temperature coefficients (FTC) and moderator temperature coefficients (MTC). The problem set is solved by the Jacobi and Gauss-Seidel (G-S) type FPI. The relaxation scheme and the Anderson acceleration are applied to improve the convergence rate of FPI. The performances of solution schemes are evaluated by comparing the number of iterations and the error reduction behavior. From those numerical investigations, it is demonstrated that the number of FPIs is increased as the feedback is stronger regardless of its sign. In addition, the Jacobi type FPIs generally shows a slower convergence rate than the G-S type FPI. It also turns out that the xenon equilibrium model can cause numerical instability for certain conditions. Lastly, it is figured out that the Anderson acceleration can effectively improve the convergence behaviors of FPI, compared to the conventional relaxation scheme.

Numerical Integration of Non-linear Equation of Motion using Operation of Integration (적분행렬을 이용한 비선형 운동방정식 수치적분)

  • Lee, Donghun;Kwon, Jae-Wook;Choi, Sujin;Rew, Dong-Young;Ju, Gwanghyeok
    • Aerospace Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.60-65
    • /
    • 2014
  • In this paper, numerical integration method using operational matrix of integration is studied. Using the operational matrix of integration, modified fixed point iteration method is introduced in order to solve rapidly an initial value problem for non-linear equation of motion. As an example, an initial value problem for orbital motion is considered. Through the numerical example, it is shown that the algorithm is efficient from the computational time point of view.

A Study on Nonlinear Water-Wave Profile (비선형 해양파의 파형 연구에 관하여)

  • JANG TAEK-SOO;WANG SUNG-HYUNH;KWON SUN-HONG
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.11a
    • /
    • pp.179-182
    • /
    • 2004
  • This paper deals with a new mathematical formulation of nonlinear wave profile based on Banach fixed point theorem. As application of the formulation and its solution procedure, some numerical solutions was presented in this paper and nonlinear equation was derived. Also we introduce a new operator for iteration and getting solution. A numerical study was accomplished with Stokes' first-order solution and iteration scheme, and then we can know the nonlinear characteristic of Stokes' high-order solution. That is, using only Stokes' first-oder(linear) velocity potential and an initial guess of wave profile, it is possible to realize the corresponding high-oder Stokian wave profile with tile new numerical scheme which is the method of iteration. We proved the mathematical convergence of tile proposed scheme. The nonlinear strategy of iterations has very fast convergence rate, that is, only about 6-10 iterations arc required to obtain a numerically converged solution.

  • PDF

A GENERALIZATION OF LOCAL SYMMETRIC AND SKEW-SYMMETRIC SPLITTING ITERATION METHODS FOR GENERALIZED SADDLE POINT PROBLEMS

  • Li, Jian-Lei;Luo, Dang;Zhang, Zhi-Jiang
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1167-1178
    • /
    • 2011
  • In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Cao, On local Hermitian and Skew-Hermitian splitting iteration methods for generalized saddle point problems, J. Comput. Appl. Math., 2009(231): 973-982] for the generalized saddle point problems to generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. Numerical experiments show the effectiveness of the iterative methods.

THE USE OF ITERATIVE METHODS FOR SOLVING NAVEIR-STOKES EQUATION

  • Behzadi, Shadan Sadigh;Fariborzi Araghi, Mohammad Ali
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.381-394
    • /
    • 2011
  • In this paper, a Naveir-Stokes equation is solved by using the Adomian's decomposition method (ADM), modified Adomian's decomposition method (MADM), variational iteration method (VIM), modified variational iteration method (MVIM), modified homotopy perturbation method (MHPM) and homotopy analysis method (HAM). The approximate solution of this equation is calculated in the form of series which its components are computed by applying a recursive relation. The existence and uniqueness of the solution and the convergence of the proposed methods are proved. A numerical example is studied to demonstrate the accuracy of the presented methods.

Numerically Stable Subspace Iteration Method (수치적으로 안정한 부분공간 반복법)

  • 정형조;김만철;박선규;이인원
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.10a
    • /
    • pp.84-91
    • /
    • 1998
  • A numerically stable technique to remove tile limitation in choosing a shift in the subspace iteration method with shift is presented. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. This study selves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shiht is an eigenvalue itself. This is one of tile significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered

  • PDF