• Title/Summary/Keyword: local iteration

Search Result 107, Processing Time 0.023 seconds

A MESH-INDEPENDENCE PRINCIPLE FOR OPERATORS EQUATIONS AND THE STEFFENSEN METHOD

  • Argyros, Ioannis-K.
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.2
    • /
    • pp.323-340
    • /
    • 1997
  • In this study we prove the mesh-independence principle via Steffensen's method. This principle asserts that when Steffensen's method is applied to a nonlinear equation between some Banach spaces as well as to some finite-dimensional discretization of that equation then the behavior of th discretized process is asymptoti-cally the same as that for the original iteration. Local and semilo-cal convergencve results as well as an error analysis for Steffensen's method are also provided.

ON SOME OUTSTANDING PROBLEMS IN NUCLEAR REACTOR ANALYSIS

  • Cho, Nam-Zin
    • Nuclear Engineering and Technology
    • /
    • v.44 no.2
    • /
    • pp.207-224
    • /
    • 2012
  • This article discusses selects of some outstanding problems in nuclear reactor analysis, with proposed approaches thereto and numerical test results, as follows: i) multi-group approximation in the transport equation, ii) homogenization based on isolated single-assembly calculation, and iii) critical spectrum in Monte Carlo depletion.

Hierachical 3-D Shape Reconstruction from Shading Using Genetic Algorithm (유전자 알고리즘을 이용한 밝기 정보로부터 3차원 표면 형상의 재구성)

  • 안은영;박현남;조형제
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.476-478
    • /
    • 1998
  • 본 논문에서는 영상의 밝기 정보로부터 물체의 표면 형상을 재구성하는 새로운 접근 방법을 제시한다. 이미지 모델은 기존의 Lambertian surface model에 거리 요소를 포함시켜 보다 현실과 비슷한 제약 조건을 주고, 국지 해(local minima)에 빠지기 쉬운 기존의 iteration 방법을 탈피하기 위해 유전자 알고리즘(genetic algorithm)을 도입한다. 표면의 깊이 정보를 이산여현변환(discrete cosine transform)하고 이 DCT 공간상에서 유전자 알고리즘을 적용함으로써 큰 형상을 먼저 결정한 후 미세한 형상을 찾아내는 계층적인 표면 형상의 재구성이 가능하도록 하였으며 간단한 실험으로 그 타당성을 보인다.

  • PDF

Fault Location Algorithm using Software Fault Tolerance (Software Fault Tolerance를 이용한 송전선로의 고장점 표정 알고리즘)

  • Jang, Yong-Won;Han, Seung-Su;Kim, Won-Ha
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.875-877
    • /
    • 2003
  • This paper use fault location algorithm for single-phase-to-ground faults on the teed circuit of a parallel transmission line that use only local end voltage and current information. When Newton-Raphson iteration method is used, the Initial value may cause error or cause not suitable result. Suggested new calculation model uses NVP methodology, which is one of the fault tolerance technology to solve this problem. EMTP simulation result has shown effectiveness of the algorithm under various conditions.

  • PDF

Transceiver Design Using Local Channel State Information at Relays for A Multi-Relay Multi-User MIMO Network

  • Cho, Young-Min;Yang, Janghoon;Kim, Dong Ku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2616-2635
    • /
    • 2013
  • In this paper, we propose an iterative transceiver design in a multi-relay multi-user multiple-input multiple-output (MIMO) system. The design criterion is to minimize sum mean squared error (SMSE) under relay sum power constraint (RSPC) where only local channel state information (CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel between BS and the relay in the $1^{st}$ hop link, and the CSI of the channel between the relay and all users in the $2^{nd}$ hop link. Exploiting BS transmitter structure which is concatenated with block diagonalization (BD) precoder, each relay's precoder can be determined using local CSI at the relay. The proposed scheme is based on sequential iteration of two stages; stage 1 determines BS transmitter and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. We verify that the proposed scheme outperforms simple amplify-and-forward (SAF), minimum mean squared error (MMSE) relay, and an existing good scheme of [13] in terms of both SMSE and sum-rate performances.

The Watershed Image Segmentation Iteration Method (개선된Watershed영상분할방법)

  • 권기홍
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.12
    • /
    • pp.923-928
    • /
    • 2003
  • A severe drawback to the calculation of watershed images is over segmentation. Relevant object contours are lost in a sea of irrelevant ones. This is partly caused by random noise, inherent to a data, which gives rise to additional local minima, such that many catchments basins are further subdivided. Proposed watershed image segmentation algorithm is iteratively merging neighboring regions that have similar gray level distributions, to restore image.

  • PDF

A Numerical Study on the Extinction of Methane/Air Counterflow Premixed Flames (대향류 메탄/공기 예혼합화염의 소염특성에 관한 수치해석적 연구)

  • 정대헌;정석호
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.8
    • /
    • pp.1982-1988
    • /
    • 1995
  • Methane/Air premixed flames are studied numerically, using a detailed chemical model, to investigate the flame strech effects on the extinction in a counterflow. The finite difference method, time integration and modified Newton iteration are used, and adaptive grid technique and grid smoothing have been employed to adjust the grid system according to the spatial steepness of the solution profiles. Results show that the flame stretch, or the conventional nondimensionalized stretch having the tangential flow characteristics of the stretched flame alone cannot adequately describes the extinction phenomena. On the other hand, the local flame stretch having both the normal and tangential flow characteristics of the stretched flame can give a proper explanation to the extinction of the symmetric planar premixed flames stabilized in a counter flow. The extinction condition were found to be a constant local stretch regardless of the equivalence ratio.

QUASI-LIKELIHOOD REGRESSION FOR VARYING COEFFICIENT MODELS WITH LONGITUDINAL DATA

  • Kim, Choong-Rak;Jeong, Mee-Seon;Kim, Woo-Chul;Park, Byeong-U.
    • Journal of the Korean Statistical Society
    • /
    • v.33 no.4
    • /
    • pp.367-379
    • /
    • 2004
  • This article deals with the nonparametric analysis of longitudinal data when there exist possible correlations among repeated measurements for a given subject. We consider a quasi-likelihood regression model where a transformation of the regression function through a link function is linear in time-varying coefficients. We investigate the local polynomial approach to estimate the time-varying coefficients, and derive the asymptotic distribution of the estimators in this quasi-likelihood context. A real data set is analyzed as an illustrative example.

A Study for the Minimum Weight Design of a Coastal Fishing Boat (소형 연안 어선의 최소 중량 설계에 관한 연구)

  • Song, Ha-Cheol;Kim, Yong-Sub;Shim, Chun-Sik
    • Journal of Navigation and Port Research
    • /
    • v.32 no.3
    • /
    • pp.223-228
    • /
    • 2008
  • As most of small fishing boats made of FRP have been constructed by experience in Korea, some structural safety problems have been occurred occasionally. To improve the structural strength and reduce the costs for construction and operation, optimum design for small fishing boat was carried out in this study. The weight of fishing boat and the main dimensions of structural members are chosen as objective function and design variables, respectively. By the combination of global and local search methods, a hybrid optimization algorithm was developed to escape the local minima and reduce CPU time in analysis procedure, and finite element analysis was performed to determine the constraint parameters at each iteration step in optimization loop. Optimization results were compared with the real existing fishing boat, and the effects of optimum design were examined from points of view; structural strength, material cost, etc.

Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved (전역 최적 경로가 향상되지 않는 반복 탐색 횟수를 고려한 개미 집단 시스템)

  • Lee, Seung-Gwan;Lee, Dae-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.9-15
    • /
    • 2009
  • Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.