• 제목/요약/키워드: Iteration Method

검색결과 1,147건 처리시간 0.024초

Impedance Imaging of Binary-Mixture Systems with Regularized Newton-Raphson Method

  • Kim, Min-Chan;Kim, Sin;Kim, Kyung-Youn
    • 에너지공학
    • /
    • 제10권3호
    • /
    • pp.183-187
    • /
    • 2001
  • Impedance imaging for binary mixture is a kind of nonlinear inverse problem, which is usually solved iteratively by the Newton-Raphson method. Then, the ill-posedness of Hessian matrix often requires the use of a regularization method to stabilize the solution. In this study, the Levenberg-Marquredt regularization method is introduced for the binary-mixture system with various resistivity contrasts (1:2∼1:1000). Several mixture distribution are tested and the results show that the Newton-Raphson iteration combined with the Levenberg-Marquardt regularization can reconstruct reasonably good images.

  • PDF

Jacobian-free Newton Krylov two-node coarse mesh finite difference based on nodal expansion method

  • Zhou, Xiafeng
    • Nuclear Engineering and Technology
    • /
    • 제54권8호
    • /
    • pp.3059-3072
    • /
    • 2022
  • A Jacobian-Free Newton Krylov Two-Nodal Coarse Mesh Finite Difference algorithm based on Nodal Expansion Method (NEM_TNCMFD_JFNK) is successfully developed and proposed to solve the three-dimensional (3D) and multi-group reactor physics models. In the NEM_TNCMFD_JFNK method, the efficient JFNK method with the Modified Incomplete LU (MILU) preconditioner is integrated and applied into the discrete systems of the NEM-based two-node CMFD method by constructing the residual functions of only the nodal average fluxes and the eigenvalue. All the nonlinear corrective nodal coupling coefficients are updated on the basis of two-nodal NEM formulation including the discontinuity factor in every few newton steps. All the expansion coefficients and interface currents of the two-node NEM need not be chosen as the solution variables to evaluate the residual functions of the NEM_TNCMFD_JFNK method, therefore, the NEM_TNCMFD_JFNK method can greatly reduce the number of solution variables and the computational cost compared with the JFNK based on the conventional NEM. Finally the NEM_TNCMFD_JFNK code is developed and then analyzed by simulating the representative PWR MOX/UO2 core benchmark, the popular NEACRP 3D core benchmark and the complicated full-core pin-by-pin homogenous core model. Numerical solutions show that the proposed NEM_TNCMFD_JFNK method with the MILU preconditioner has the good numerical accuracy and can obtain higher computational efficiency than the NEM-based two-node CMFD algorithm with the power method in the outer iteration and the Krylov method using the MILU preconditioner in the inner iteration, which indicates the NEM_TNCMFD_JFNK method can serve as a potential and efficient numerical tool for reactor neutron diffusion analysis module in the JFNK-based multiphysics coupling application.

영상분할의 최적 임계치를 구하는 빠른 방법 (A Fast Method for Finding the Optimal Threshold for Image Segmentation)

  • 신용식;이정훈
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
    • /
    • pp.109-112
    • /
    • 2001
  • 영상분할에 있어서 최적의 임계치를 구하는 것은 영상을 구성하고 있는 픽셀들을 의미있는 집단으로 나누는 거와 같으며 이를 위하여 퍼지화 정도를 측정하여 최소의 퍼지화 정도를 갖는 임계치를 최적의 임계치로 설정한다. 일반적으로 소속도는 하나의 픽셀과 그 픽셀이 속한 영역의 관계로 표현될 수 있는데 소속도 계산을 위한 엔트로피로 샤논(Shannon)함수를 사용한다[1]. Liang-Kai Huang에 의하여 제안된 알고리즘은 그 수렴속도 면에 있어서 많은 문제점을 갖고 있다[2]. 본 논문에서는 이런 수렴속도를 좀더 개선하기 위하여 SPOI(Simplified Fixed Point Iteration)를 제안하고 여러 가지 실험영상을 사용하여 졔안된 논문의 우수성을 보이고자 한다. 실험결과 적절한 임계치를 구하면서도 기존의 논문보다 속도면에서 상당히 우수한 특성을 보이고 있다.

  • PDF

ITERATIVE APPROXIMATION OF FIXED POINTS FOR φ-HEMICONTRACTIVE OPERATORS IN BANACH SPACES

  • Liu, Zeqing;An, Zhefu;Li, Yanjuan;Kang, Shin-Min
    • 대한수학회논문집
    • /
    • 제19권1호
    • /
    • pp.63-74
    • /
    • 2004
  • Suppose that X is a real Banach space, K is a nonempty closed convex subset of X and T : $K\;\rightarrow\;K$ is a uniformly continuous ${\phi}$-hemicontractive operator or a Lipschitz ${\phi}-hemicontractive$ operator. In this paper we prove that under certain conditions the three-step iteration methods with errors converge strongly to the unique fixed point of T. Our results extend the corresponding results of Chang [1], Chang et a1. [2], Chidume [3]-[7], Chidume and Osilike [9], Deng [10], Liu and Kang [13], [14], Osilike [15], [16] and Tan and Xu [17].

이기종 통신 시스템을 위한 EMD 기반 노이즈 완화 기법의 성능 (Performance of Noise Mitigation scheme based on EMD for Heterogeneous Networks)

  • 심이삭;황유민;양병문;김진영
    • 한국위성정보통신학회논문지
    • /
    • 제11권1호
    • /
    • pp.26-31
    • /
    • 2016
  • 본 논문에서는 이기종 통신 시스템에서 Empirical Mode Decomposition(EMD) 기법을 활용하여 통신 신호의 잡음을 완화시키는 방안을 제시하였다. EMD는 노이즈가 인가된 신호를 여러 개의 Intrinsic Mode Function(IMF)로 분할하여 노이즈가 포함된 IMF를 제거하는 방법으로 노이즈를 줄이는 방법이다. 본 논문에서는 EMD의 연산량을 줄이기 위해 새로운 반복 중지 규칙을 제시하였다. EMD의 적용 방법을 수식 및 알고리즘으로 구현하였다. 3종류의 잡음이 인가된 신호를 시뮬레이션을 통해 효과적으로 잡음이 완화되는 것을 확인하였다.

하알 함수를 이용한 비선형계의 계층별 최적제어 (Hierarchical Optimal Control of Nonlinear System using Haar Function)

  • 박정호;조영호;신승권;정제욱;심재선;안두수
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 추계학술대회 논문집 학회본부 B
    • /
    • pp.485-487
    • /
    • 1999
  • We propose the algorithm with which one can solve the problem of the two-level hierarchical optimal control of nonlinear systems by repeatedly updating the state vectors using the haar function and Picard's iteration methods. Using the simple operation of the coefficient vectors from the fast haar transformation in the upper level and applying that vectors to Picard iteration methods in the independently lower level allow us to obtain the another method except the inversion matrix operation of the high dimention and the kronecker product in the optimal control algorithm.

  • PDF

Bypass, homotopy path and local iteration to compute the stability point

  • Fujii, Fumio;Okazawa, Shigenobu
    • Structural Engineering and Mechanics
    • /
    • 제5권5호
    • /
    • pp.577-586
    • /
    • 1997
  • In nonlinear finite element stability analysis of structures, the foremost necessary procedure is the computation to precisely locate a singular equilibrium point, at which the instability occurs. The present study describes global and local procedures for the computation of stability points including bifurcation points and limit points. The starting point, at which the procedure will be initiated, may be close to or arbitrarily far away from the target point. It may also be an equilibrium point or non-equilibrium point. Apart from the usual equilibrium path, bypass and homotopy path are proposed as the global path to the stability point. A local iterative method is necessary, when it is inspected that the computed path point is sufficiently close to the stability point.

2nd-order PD-type Learning Control Algorithm

  • Kim, Yong-Tae;Zeungnam Bien
    • 한국지능시스템학회논문지
    • /
    • 제14권2호
    • /
    • pp.247-252
    • /
    • 2004
  • In this paper are proposed 2nd-order PD-type iterative learning control algorithms for linear continuous-time system and linear discrete-time system. In contrast to conventional methods, the proposed learning algorithms are constructed based on both time-domain performance and iteration-domain performance. The convergence of the proposed learning algorithms is proved. Also, it is shown that the proposed method has robustness in the presence of external disturbances and the convergence accuracy can be improved. A numerical example is provided to show the effectiveness of the proposed algorithms.

Auction 알고리즘의 수학적 등가를 이용한 최단경로에 관한 연구 (A Study on the Shortest Path using the Mathematical Equivalence of the Auction Algorithm)

  • 우경환;홍용인;최상국;이천희
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 하계종합학술대회 논문집
    • /
    • pp.337-340
    • /
    • 1999
  • At each iteration, the path is either extended by adding a new node, or contracted by deleting its terminal node. When the destination becomes the terminal node of the path, the algorithm terminate. In the process of finding the shortest path to given destination, the algorithm visits other node, there by obtaining a shortest path from the origin to them. We show here that when the auction algorithm is applied to this equivalent program with some special rules for choosing the initial object prices and the person submitting a bid at each iteration, one obtains the generic form of the $\varepsilon$-relaxation method. Thus, the two methods are mathematically equivalent

  • PDF

Robust Control of a Glass Fiber Composite Beam using $\mu$-Synthesis Algorithm

  • Lee, Seong-cheol;Kwon, Tae-Kyu;Yun, Yeo-Hung
    • International Journal of Precision Engineering and Manufacturing
    • /
    • 제1권2호
    • /
    • pp.76-83
    • /
    • 2000
  • A study on the robust control of a composite beam with a distributed PVDF sensor and piezo-ceramic actuator is presented in this paper. $1^{st}$ and $2^{nd}$ natural frequencies are considered in the modeling, because robust control theory which has robustness to structured uncertainty is adopted to suppress the vibration. If the controllers designed by $H_{\infty}$ theory do not satisfy control performance, it is improved by $\mu$-synthesis method with D-K iteration so that the $\mu$-controller based on the structured singular value satisfies the nominal performance and robust performance. Simulation and experiment were carried out with the designed controller and the verification of the robust control properties was presented by results.

  • PDF