• 제목/요약/키워드: iteration method

검색결과 1,145건 처리시간 0.026초

The JFNK method for the PWR's transient simulation considering neutronics, thermal hydraulics and mechanics

  • He, Qingming;Zhang, Yijun;Liu, Zhouyu;Cao, Liangzhi;Wu, Hongchun
    • Nuclear Engineering and Technology
    • /
    • 제52권2호
    • /
    • pp.258-270
    • /
    • 2020
  • A new task of using the Jacobian-Free-Newton-Krylov (JFNK) method for the PWR core transient simulations involving neutronics, thermal hydraulics and mechanics is conducted. For the transient scenario of PWR, normally the Picard iteration of the coupled coarse-mesh nodal equations and parallel channel TH equations is performed to get the transient solution. In order to solve the coupled equations faster and more stable, the Newton Krylov (NK) method based on the explicit matrix was studied. However, the NK method is hard to be extended to the cases with more physics phenomenon coupled, thus the JFNK based iteration scheme is developed for the nodal method and parallel-channel TH method. The local gap conductance is sensitive to the gap width and will influence the temperature distribution in the fuel rod significantly. To further consider the local gap conductance during the transient scenario, a 1D mechanics model is coupled into the JFNK scheme to account for the fuel thermal expansion effect. To improve the efficiency, the physics-based precondition and scaling technique are developed for the JFNK iteration. Numerical tests show good convergence behavior of the iterations and demonstrate the influence of the fuel thermal expansion effect during the rod ejection problems.

Substructural parameters and dynamic loading identification with limited observations

  • Xu, Bin;He, Jia
    • Smart Structures and Systems
    • /
    • 제15권1호
    • /
    • pp.169-189
    • /
    • 2015
  • Convergence difficulty and available complete measurement information have been considered as two primary challenges for the identification of large-scale engineering structures. In this paper, a time domain substructural identification approach by combining a weighted adaptive iteration (WAI) algorithm and an extended Kalman filter method with a weighted global iteration (EFK-WGI) algorithm was proposed for simultaneous identification of physical parameters of concerned substructures and unknown external excitations applied on it with limited response measurements. In the proposed approach, according to the location of the unknown dynamic loadings and the partially available structural response measurements, part of structural parameters of the concerned substructure and the unknown loadings were first identified with the WAI approach. The remaining physical parameters of the concerned substructure were then determined by EFK-WGI basing on the previously identified loadings and substructural parameters. The efficiency and accuracy of the proposed approach was demonstrated via a 20-story shear building structure and 23 degrees of freedom (DOFs) planar truss model with unknown external excitation and limited observations. Results show that the proposed approach is capable of satisfactorily identifying both the substructural parameters and unknown loading within limited iterations when both the excitation and dynamic response are partially unknown.

환자 우선순위를 고려한 수술실 예약 : 이진검색을 활용한 수정 평가치반복법 (Operating Room Reservation Problem Considering Patient Priority : Modified Value Iteration Method with Binary Search)

  • 민대기
    • 산업공학
    • /
    • 제24권4호
    • /
    • pp.274-280
    • /
    • 2011
  • Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

Robust Nonparametric Regression Method using Rank Transformation

    • Communications for Statistical Applications and Methods
    • /
    • 제7권2호
    • /
    • pp.574-574
    • /
    • 2000
  • Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

Robust Nonparametric Regression Method using Rank Transformation

  • Park, Dongryeon
    • Communications for Statistical Applications and Methods
    • /
    • 제7권2호
    • /
    • pp.575-583
    • /
    • 2000
  • Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

  • PDF

반복 그린 함수 방법을 이용한 도파관 스텁 구조의 새로운 해석법 (Novel Analysis of Waveguide Stub Structure Using Iterative Green's Function Method)

  • 조용희
    • 한국콘텐츠학회논문지
    • /
    • 제7권2호
    • /
    • pp.125-131
    • /
    • 2007
  • 학부생들이 쉽게 사용할 수 있는 기법인 반복 그린 함수 방법(IGFM)을 이용하여 복잡한 전자파 도파관스텁 구조를 이론적으로 엄밀하게 해석한다. lGFM은 그린 함수 접근법과 영역 반복법을 이용한다. IGFM의 간단한 공식화를 위해 단순한 수학 방정식만을 사용한 물리적인 반복 메커니즘을 이용한다. 전형적인 전자파 도파관 구조인 평행판 E평면 T접합 스텁에 대한 산란 특성을 IGFM 관점에서 이론적으로 공식화한다. 수치해석 결과를 주파수에 대한 반사와 투과 전력 관점에서 보인다.

A Study on the Methods for Solving the Theodorsen Equation for Numerical Conformal Mapping

  • Song, Eun-Jee
    • Journal of information and communication convergence engineering
    • /
    • 제10권1호
    • /
    • pp.66-70
    • /
    • 2012
  • Conformal mapping has been a familiar tool of science and engineering for generations. Determination of a conformal map from the unit disk onto the Jordan region is reduced to solving the Theodorsen equation, which is an integral equation for boundary correspondence functions. There are many methods for solving the Theodorsen equation. It is the goal of numerical conformal mapping to find methods that are at once fast, accurate, and reliable. In this paper, we analyze Niethammer’s solution based on successive over-relaxation (SOR) iteration and Wegmann’s solution based on Newton iteration, and compare them to determine which one is more effective. Through several numerical experiments with these two methods, we can see that Niethammer’s method is more effective than Wegmann’s when the degree of the problem is low and Wegmann’s method is more effective than Niethammer’s when the degree of the problem is high.

다기 전력 시스템의 안정화를 위한 탐색화된 정책 반복법 기반 적응형 강인 제어기 설계 (Design of an Adaptive Robust Controller Based on Explorized Policy Iteration for the Stabilization of Multimachine Power Systems)

  • 전태윤;박진배
    • 제어로봇시스템학회논문지
    • /
    • 제20권11호
    • /
    • pp.1118-1124
    • /
    • 2014
  • This paper proposes a novel controller design scheme for multimachine power systems based on the explorized policy iteration. Power systems have several uncertainties on system dynamics due to the various effects of interconnections between generators. To solve this problem, the proposed method solves the LQR (Linear Quadratic Regulation) problem of isolated subsystems without the knowledge of a system matrix and the interconnection parameters of multimachine power systems. By selecting the proper performance indices, it guarantees the stability and convergence of the LQ optimal control. To implement the proposed scheme, the least squares based online method is also investigated in terms of PE (Persistency of Excitation), interconnection parameters and exploration signals. Finally, the performance and effectiveness of the proposed algorithm are demonstrated by numerical simulations of three-machine power systems with governor controllers.

NEW PRIMAL-DUAL INTERIOR POINT METHODS FOR P*(κ) LINEAR COMPLEMENTARITY PROBLEMS

  • Cho, Gyeong-Mi;Kim, Min-Kyung
    • 대한수학회논문집
    • /
    • 제25권4호
    • /
    • pp.655-669
    • /
    • 2010
  • In this paper we propose new primal-dual interior point methods (IPMs) for $P_*(\kappa)$ linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, $\psi(t)=\frac{t^2-1}{2}-{\int}^t_1e{^{q(\frac{1}{\xi}-1)}d{\xi}$, $q\;{\geq}\;1$. If a strictly feasible starting point is available and the parameter $q\;=\;\log\;\(1+a{\sqrt{\frac{2{\tau}+2{\sqrt{2n{\tau}}+{\theta}n}}{1-{\theta}}\)$, where $a\;=\;1\;+\;\frac{1}{\sqrt{1+2{\kappa}}}$, then new large-update primal-dual interior point algorithms have $O((1\;+\;2{\kappa})\sqrt{n}log\;n\;log\;{\frac{n}{\varepsilon}})$ iteration complexity which is the best known result for this method. For small-update methods, we have $O((1\;+\;2{\kappa})q{\sqrt{qn}}log\;{\frac{n}{\varepsilon}})$ iteration complexity.

A CODE FOR CALCULATING STATIC MODEL STELLAR ATMOSPHERES

  • Nouh, M.I.
    • 천문학회지
    • /
    • 제42권3호
    • /
    • pp.47-54
    • /
    • 2009
  • In this paper we present an independent FORTRAN code for calculating LTE-plane-parallel model atmospheres. The transfer equation has been solved using Avrett and Loeser method. It is shown that, using an approximate non-gray temperature distribution together with the iteration factors method (Simonneau and Crivellari) for correcting the temperature distribution reduce the number of iteration required to achieve the condition of radiative equilibrium. Preliminary results for pure helium model atmospheres are presented.