• Title/Summary/Keyword: Iteration number

Search Result 352, Processing Time 0.028 seconds

NUMBER OF VERTICES FOR POLYGONAL FUNCTIONS UNDER ITERATION

  • Li, Lin
    • The Pure and Applied Mathematics
    • /
    • v.14 no.2 s.36
    • /
    • pp.99-109
    • /
    • 2007
  • Being complicated in computation, iteration of a nonlinear 1-dimensional mapping makes many interesting problems, one of which is about the change of the number of vertices under iteration. In this paper we investigate iteration of polygonal functions which each have only one vertex and give conditions under which the number of vertices either does not increase or has a bound under iteration.

  • PDF

Variable Iteration Decoding Control Method of Iteration Codes using CRC-code (CRC부호를 이용한 반복복호부호의 반복복호 제어기법)

  • Baek, Seung-Jae;Park, Jin-Soo
    • The KIPS Transactions:PartC
    • /
    • v.11C no.3
    • /
    • pp.353-360
    • /
    • 2004
  • In this Paper, We propose an efficient iteration decoding control method with variable iteration decoding of iteration codes decoding using Cyclic Redundancy Check. As the number of iterations increases, the bit error rate and frame error rate of the decoder decrease and the incremental improvement gradually diminishes. However, when the iteration decoding number is increased, it require much delay and amount of processing time for decoding. Also, It can be observed the error nor that the performance cannot be improved even though increasing of the number of iterations and SNR. So, Suitable number of iterations for stopping criterion is required. we propose variable iteration control method to adapt variation of channel using Frame Error-Check indicator. Therefore, the amount of computation and the number of iterations required for iteration decoding with CRC method can be reduced without sacrificing performance.

Variable Iteration Decoding Control Method for Iteration Codes (Iteration 부호의 가변반복복호 제어기법)

  • 백승재;이성우;박진수
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.753-757
    • /
    • 2003
  • In this paper, We propose an efficient iteration decoding control method with variable iteration decoding for iteration codes decoding. As the number of iterations increases, the bit error rate and frame error rate of the decoder decrease and the incremental improvement gradually diminishes. However, as the iteration decoding number is increase, it require much delay and amount of processing for decoding. Thus we propose variable iteration control method to adapt variation of channel using Frame Error-Check indicator. Therefore, the CRC method requires the fewest iterations and less computation than the CE method and the SCR methods.

  • PDF

Efficient Low-Power Turbo Decoder (효율적인 저전력 터보 복호기)

  • 배성일;김재석
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.73-76
    • /
    • 1999
  • In this paper, we propose a new design of turbo decoder. It contains the simple additional unit which automatically decides the number of the iteration by detecting of the reliability value as threshold value. We investigate the relationship between the reliability value and the number of the iteration. We find the optimal threshold value without noticeable loss in performance. As a results of the simulation, it reduces the average number of the iteration compared with the conventional turbo decoder.

  • PDF

Investigation of Efficiency of Starting Iteration Vectors for Calculating Natural Modes (고유모드 계산을 위한 초기 반복벡터의 효율성 연구)

  • Kim, Byoung-Wan;Kyoung, Jo-Hyun;Hong, Sa-Young;Cho, Seok-Kyu;Lee, In-Won
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.15 no.1 s.94
    • /
    • pp.112-117
    • /
    • 2005
  • Two modified versions of subspace iteration method using accelerated starting vectors are proposed to efficiently calculate free vibration modes of structures. Proposed methods employ accelerated Lanczos vectors as starting iteration vectors in order to accelerate the convergence of the subspace iteration method. Proposed methods are divided into two forms according to the number of starting vectors. The first method composes 2p starting vectors when the number of required modes is p and the second method uses 1.5p starting vectors. To investigate the efficiency of proposed methods, two numerical examples are presented.

Stabilization effect of fission source in coupled Monte Carlo simulations

  • Olsen, Borge;Dufek, Jan
    • Nuclear Engineering and Technology
    • /
    • v.49 no.5
    • /
    • pp.1095-1099
    • /
    • 2017
  • A fission source can act as a stabilization element in coupled Monte Carlo simulations. We have observed this while studying numerical instabilities in nonlinear steady-state simulations performed by a Monte Carlo criticality solver that is coupled to a xenon feedback solver via fixed-point iteration. While fixed-point iteration is known to be numerically unstable for some problems, resulting in large spatial oscillations of the neutron flux distribution, we show that it is possible to stabilize it by reducing the number of Monte Carlo criticality cycles simulated within each iteration step. While global convergence is ensured, development of any possible numerical instability is prevented by not allowing the fission source to converge fully within a single iteration step, which is achieved by setting a small number of criticality cycles per iteration step. Moreover, under these conditions, the fission source may converge even faster than in criticality calculations with no feedback, as we demonstrate in our numerical test simulations.

SIF AND FINITE ELEMENT SOLUTIONS FOR CORNER SINGULARITIES

  • Woo, Gyungsoo;Kim, Seokchan
    • East Asian mathematical journal
    • /
    • v.34 no.5
    • /
    • pp.623-632
    • /
    • 2018
  • In [7, 8] they introduced a new finite element method for accurate numerical solutions of Poisson equations with corner singularities. They consider the Poisson equations with homogeneous boundary conditions, compute the finite element solutions using standard FEM and use the extraction formula to compute the stress intensity factor(s), then they posed new PDE with a regular solution by imposing the nonhomogeneous boundary condition using the computed stress intensity factor(s), which converges with optimal speed. From the solution they could get an accurate solution just by adding the singular part. Their algorithm involves an iteration and the iteration number depends on the acuracy of stress intensity factors, which is usually obtained by extraction formula which use the finite element solutions computed by standard Finite Element Method. In this paper we investigate the dependence of the iteration number on the convergence of stress intensity factors and give a way to reduce the iteration number, together with some numerical experiments.

Accelerated Starting Vectors for Analysis of Natural Modes of Structures (구조물의 고유모드 해석을 위한 가속화된 초기벡터 구성기법)

  • 김병완;정형조;이인원
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.784-787
    • /
    • 2004
  • Modified version of subspace iteration method using accelerated starting vectors is proposed to efficiently calculate free vibration modes of structures. Proposed method employs accelerated Lanczos starting vectors that can reduce the number of iterations in the subspace iteration method. Proposed method is more efficient than the conventional method when the number of required modes is relatively small. To verify the efficiency of proposed method, two numerical examples are presented.

  • PDF

Accelerated Subspace Iteration Method for Computing Natural Frequencies and Mode Shapes of Structures (구조물의 고유진동수 및 모드형상의 계산을 위한 가속화된 부분공간반복법)

  • Kim, Byoung-Wan;Kim, Chun-Ho;Lee, In-Won
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2003.10a
    • /
    • pp.503-508
    • /
    • 2003
  • This paper proposes modified subspace iteration method for efficient frequency analysis of structures. Proposed method uses accelerated Lanczos vectors as starting vectors in order to reduce the number of iterations in the subspace iteration method. Proposed method has better computing efficiency than the conventional method when the number of desired frequencies is relatively small. The efficiency of proposed method is verified through numerical examples.

  • PDF

Existence of Solutions for the Semilinear Fuzzy Integrodifferential Equations using by Successive Iteration

  • Kwun, Young-Chel;Kim, Mi-Ju;Lee, Bu-Young;Park, Jin-Han
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.4
    • /
    • pp.543-548
    • /
    • 2008
  • This paper is to investigate the existence theorem for the semilinear fuzzy integrodifferential equation in $E_N$ by using the concept of fuzzy number whose values are normal, convex, upper semicontinuous and compactly supported interval in $E_N$. Main tool is successive iteration method.