• Title/Summary/Keyword: Gauss-Newton algorithm

Search Result 61, Processing Time 0.023 seconds

ELECTRICAL RESISTANCE IMAGING OF TWO-PHASE FLOW WITH A MESH GROUPING TECHNIQUE BASED ON PARTICLE SWARM OPTIMIZATION

  • Lee, Bo An;Kim, Bong Seok;Ko, Min Seok;Kim, Kyung Youn;Kim, Sin
    • Nuclear Engineering and Technology
    • /
    • v.46 no.1
    • /
    • pp.109-116
    • /
    • 2014
  • An electrical resistance tomography (ERT) technique combining the particle swarm optimization (PSO) algorithm with the Gauss-Newton method is applied to the visualization of two-phase flows. In the ERT, the electrical conductivity distribution, namely the conductivity values of pixels (numerical meshes) comprising the domain in the context of a numerical image reconstruction algorithm, is estimated with the known injected currents through the electrodes attached on the domain boundary and the measured potentials on those electrodes. In spite of many favorable characteristics of ERT such as no radiation, low cost, and high temporal resolution compared to other tomography techniques, one of the major drawbacks of ERT is low spatial resolution due to the inherent ill-posedness of conventional image reconstruction algorithms. In fact, the number of known data is much less than that of the unknowns (meshes). Recalling that binary mixtures like two-phase flows consist of only two substances with distinct electrical conductivities, this work adopts the PSO algorithm for mesh grouping to reduce the number of unknowns. In order to verify the enhanced performance of the proposed method, several numerical tests are performed. The comparison between the proposed algorithm and conventional Gauss-Newton method shows significant improvements in the quality of reconstructed images.

Statistical Estimation and Algorithm in Nonlinear Functions

  • Jea-Young Lee
    • Communications for Statistical Applications and Methods
    • /
    • v.2 no.2
    • /
    • pp.135-145
    • /
    • 1995
  • A new algorithm was given to successively fit the multiexponential function/nonlinear function to data by a weighted least squares method, using Gauss-Newton, Marquardt, gradient and DUD methods for convergence. This study also considers the problem of linear-nonlimear weighted least squares estimation which is based upon the usual Taylor's formula process.

  • PDF

A study on 3-D indoor localization based on visible-light communication considering the inclination and azimuth of the receiver (수신기의 기울기 및 방위를 고려한 가시광 통신기반 3차원 실내 위치인식에 대한 연구)

  • Kim, Won-Yeol;Zin, Hyeon-Cheol;Kim, Jong-Chan;Noh, Duck-Soo;Seo, Dong-Hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.7
    • /
    • pp.647-654
    • /
    • 2016
  • Indoor localization based on visible-light communication using the received signal strength intensity (RSSI) has been widely studied because of its high accuracy compared with other wireless localization methods. However, because the RSSI can vary according to the inclination and azimuth of the receiver, a large error can occur, even at the same position. In this paper, we propose a visible-light communication-based 3-D indoor positioning algorithm using the Gauss-Newton technique in order to reduce the errors caused by the change in the inclination of the receiver. The proposed system reduces the amount of computations by selecting the initial position of the receiver through the linear least-squares method (LSM), which is applied to the RSSIs, and improves the position accuracy by applying the Gauss-Newton technique to the 3-D nonlinear model that contains the RSSIs acquired by the changes in the azimuth and inclination of the receiver. In order to verify the validity of the proposed algorithm in an indoor space with dimensions of $6{\times}6{\times}3m$ where 16 LED lights are installed, we compare and analyze the errors of the conventional linear LSM-based trilateration technique and the proposed algorithm according to the changes in the inclination and azimuth of the receiver. The experimental results show that the location accuracy of the proposed algorithm is improved by 82.5% compared to the conventional LSM-based trilateration technique.

On the Efficient Three-Dimensional Inversion of Static Shifted MT Data (정적효과를 포함한 자기지전류 자료의 효율적인 3차원 역산에 관하여)

  • Jang, Hannuree;Jang, Hangilro;Kim, Hee Joon
    • Geophysics and Geophysical Exploration
    • /
    • v.17 no.2
    • /
    • pp.95-103
    • /
    • 2014
  • This paper presents a practical inversion method for recovering a three-dimensional (3D) resistivity model and static shifts simultaneously. Although this method is based on a Gauss-Newton approach that requires a sensitivity matrix, the computer time can be greatly reduced by implementing a simple and effective procedure for updating the sensitivity matrix using the Broyden's algorithm. In this research, we examine the approximate inversion procedure and the weighting factor ${\beta}$ for static shifts through inversion experiments using synthetic MT data. In methods using the full sensitivity matrix constructed only once in the iteration process, a procedure using the full sensitivity in the earlier stage is useful to produce the smallest rms data misfit. The choice of ${\beta}$ is not critical below some threshold value. Synthetic examples demonstrate that the method proposed in this paper is effective in reconstructing a 3D resistivity structure from static-shifted MT data.

EXTENSION OF FACTORING LIKELIHOOD APPROACH TO NON-MONOTONE MISSING DATA

  • Kim, Jae-Kwang
    • Journal of the Korean Statistical Society
    • /
    • v.33 no.4
    • /
    • pp.401-410
    • /
    • 2004
  • We address the problem of parameter estimation in multivariate distributions under ignorable non-monotone missing data. The factoring likelihood method for monotone missing data, termed by Rubin (1974), is extended to a more general case of non-monotone missing data. The proposed method is algebraically equivalent to the Newton-Raphson method for the observed likelihood, but avoids the burden of computing the first and the second partial derivatives of the observed likelihood. Instead, the maximum likelihood estimates and their information matrices for each partition of the data set are computed separately and combined naturally using the generalized least squares method.

Development of an AOA Location Method Using Covariance Estimation

  • Lee, Sung-Ho;Roh, Gi-Hong;Sung, Tae-Kyung
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.485-489
    • /
    • 2006
  • In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and closed-form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a self-tuning weighted least square AOA algorithm that is a modified version of the conventional closed-form solution. In order to estimate the error covariance matrix as a weight, two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

  • PDF

Review on the Three-Dimensional Inversion of Magnetotelluric Date (MT 자료의 3차원 역산 개관)

  • Kim Hee Joon;Nam Myung Jin;Han Nuree;Choi Jihyang;Lee Tae Jong;Song Yoonho;Suh Jung Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.7 no.3
    • /
    • pp.207-212
    • /
    • 2004
  • This article reviews recent developments in three-dimensional (3-D) magntotelluric (MT) imaging. The inversion of MT data is fundamentally ill-posed, and therefore the resultant solution is non-unique. A regularizing scheme must be involved to reduce the non-uniqueness while retaining certain a priori information in the solution. The standard approach to nonlinear inversion in geophysis has been the Gauss-Newton method, which solves a sequence of linearized inverse problems. When running to convergence, the algorithm minimizes an objective function over the space of models and in the sense produces an optimal solution of the inverse problem. The general usefulness of iterative, linearized inversion algorithms, however is greatly limited in 3-D MT applications by the requirement of computing the Jacobian(partial derivative, sensitivity) matrix of the forward problem. The difficulty may be relaxed using conjugate gradients(CG) methods. A linear CG technique is used to solve each step of Gauss-Newton iterations incompletely, while the method of nonlinear CG is applied directly to the minimization of the objective function. These CG techniques replace computation of jacobian matrix and solution of a large linear system with computations equivalent to only three forward problems per inversion iteration. Consequently, the algorithms are efficient in computational speed and memory requirement, making 3-D inversion feasible.

Adaptive Parameter Estimation for Noisy ARMA Process (잡음 ARMA 프로세스의 적응 매개변수추정)

  • 김석주;이기철;박종근
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.4
    • /
    • pp.380-385
    • /
    • 1990
  • This Paper presents a general algorithm for the parameter estimation of an antoregressive moving average process observed in additive white noise. The algorithm is based on the Gauss-Newton recursive prediction error method. For the parameter estimation, the output measurement is modelled as an innovation process using the spectral factorization, so that noise free RPE ARMA estimation can be used. Using apriori known properties leads to algorithm with smaller computation and better accuracy be the parsimony principle. Computer simulation examples show the effectiveness of the proposed algorithm.

Accelerating Levenberg-Marquardt Algorithm using Variable Damping Parameter (가변 감쇠 파라미터를 이용한 Levenberg-Marquardt 알고리즘의 학습 속도 향상)

  • Kwak, Young-Tae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.4
    • /
    • pp.57-63
    • /
    • 2010
  • The damping parameter of Levenberg-Marquardt algorithm switches between error backpropagation and Gauss-Newton learning and affects learning speed. Fixing the damping parameter induces some oscillation of error and decreases learning speed. Therefore, we propose the way of a variable damping parameter with referring to the alternation of error. The proposed method makes the damping parameter increase if error rate is large and makes it decrease if error rate is small. This method so plays the role of momentum that it can improve learning speed. We tested both iris recognition and wine recognition for this paper. We found out that this method improved learning speed in 67% cases on iris recognition and in 78% cases on wine recognition. It was also showed that the oscillation of error by the proposed way was less than those of other algorithms.

Load Flow Calculation Using Genetic Algorithm (유전자 알고리듬을 이용한 조류계산)

  • Kim, H.;Lee, J.;Cha, J.;Choi, J.;Kwon, S.
    • Proceedings of the KIEE Conference
    • /
    • 2005.07a
    • /
    • pp.78-80
    • /
    • 2005
  • The load flow calculation is one of the most critical issues in electrical power systems. Generally, load flow has been calculated by Gauss-Seidel method and Newton-Raphson method but these methods have some problems such as non-convergence due to heavy load and initial value. In this paper, to overcome such problems, the power flow is calculated by genetic algorithm. At the heavy load, the solution for problem can not be obtained by the Newton-Raphson method. However, it can be solved in case of using genetic algorithm. In this paper, the strong point of this method would be demonstrated in application to an example system.

  • PDF