• Journal of the Computational Structural Engineering Institute of Korea
• /
• 제26권4호
• /
• pp.223-231
• /
• 2013

This paper presents a time-domain Gauss-Newton full-waveform inversion method for the material profile reconstruction in heterogeneous semi-infinite solid media. To implement the inverse problem in a finite computational domain, perfectly-matchedlayers( PMLs) are introduced as wave-absorbing boundaries within which the domain's wave velocity profile is to be reconstructed. The inverse problem is formulated in a partial-differential-equations(PDE)-constrained optimization framework, where a least-squares misfit between measured and calculated surface responses is minimized under the constraint of PML-endowed wave equations. A Gauss-Newton-Krylov optimization algorithm is utilized to iteratively update the unknown wave velocity profile with the aid of a specialized regularization scheme. Through a series of one-dimensional examples, the solution of the Gauss-Newton inversion was close enough to the target profile, and showed superior convergence behavior with reduced wall-clock time of implementation compared to a conventional inversion using Fletcher-Reeves optimization algorithm.

• Journal of the Korean Mathematical Society
• /
• 제33권4호
• /
• pp.865-878
• /
• 1996

We consider numerical methods for finding a solution to a nonlinear system of algebraic equations $$ (1) f(x) = 0, $$ where the function $f : R^n \to R^n$ is ain $x \in R^n$. In [10], a quasi-Gauss-Newton method is proposed and shown the computational efficiency over SQRT algorithm by numerical experiments. The convergence rate of the method has not been proved theoretically. In this paper, we show theoretically that the iterate $x_k$ obtained from the quasi-Gauss-Newton method for the problem (1) actually converges to a root by Kantorovich-type convergence analysis. We also show the rate of convergence of the method is superlinear.

• Geophysics and Geophysical Exploration
• /
• 제7권3호
• /
• pp.191-196
• /
• 2004

Seismic waveform inversion can be solved by using the classical Gauss-Newton method, which needs to construct the huge Hessian by the directly computed Jacobian. The property of Hessian mainly depends upon a source and receiver aperture, a velocity model, an illumination Bone and a frequency content of source wavelet. In this paper, we try to invert the Marmousi seismic data by controlling the huge Hessian appearing in the Gauss-Newton method. Wemake the two kinds of he approximate Hessian. One is the banded Hessian and the other is the approximate Hessian with automatic gain function. One is that the 1st updated velocity model from the banded Hessian is nearly the same of the result from the full approximate Hessian. The other is that the stability using the automatic gain function is more improved than that without automatic gain control.

• Journal of the Korean Mathematical Society
• /
• 제56권2호
• /
• pp.311-327
• /
• 2019

The aim of this paper is to extend the applicability of Gauss-Newton method for solving underdetermined nonlinear least squares problems in cases not covered before. The novelty of the paper is the introduction of a restricted convergence domain. We find a more precise location where the Gauss-Newton iterates lie than in earlier studies. Consequently the Lipschitz constants are at least as small as the ones used before. This way and under the same computational cost, we extend the local as well the semilocal convergence of Gauss-Newton method. The new developmentes are obtained under the same computational cost as in earlier studies, since the new Lipschitz constants are special cases of the constants used before. Numerical examples further justify the theoretical results.

• Journal of the Institute of Electronics and Information Engineers
• /
• 제52권8호
• /
• pp.148-155
• /
• 2015

The Levenberg-Marquardt method is a well known solution about the least square problem. However, in a Target Motion Analysis(TMA) application most of researches have used the Gauss-Newton method as a batch estimator, which of inverse matrix calculation may causes instability problem. In this paper, Levenberg-Marquardt method is applied to TMA problem to prevent its divergence. In experiment, its performance is compared with Gauss-Newton in domain of range, course and speed. Monte Carlo simulation reveals the convergence time and reliability of the TMA based on Levenberg-Marquardt.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제14권7호
• /
• pp.3460-3467
• /
• 2013

The In this paper, we have made numerical experiments to compare 2D image reconstruction algorithm of earth model by electrical resistance tomograpy (ERT). Gauss-Newton, simultaneous iterative reconstruction technieque (SIRT) and truncated least squares (TLS) approaches for Wenner and Schlumberger electrode arrays are presented for the solution of the ERT image reconstruction. Computer simulations show that the Gauss-Newton and TLS approach in ERT are proper for 2D image reconstruction of an earth model.

• 한국지구물리탐사학회:학술대회논문집
• /
• 한국지구물리탐사학회 2006년도 공동학술대회 논문집
• /
• pp.131-135
• /
• 2006

A seismic waveform inversion for prestack seismic data based on the Gauss-Newton method is presented. The Gauss-Newton method for seismic waveform inversion was proposed in the 80s but has rarely been studied. Extensive computational and memory requirements have been principal difficulties. To overcome this, we used different sizes of grids in the inversion stage from those of grids in the wave propagation simulation, temporal windowing of the simulation and approximation of virtual sources for calculating partial derivatives, and implemented this algorithm on parallel supercomputers. We show that the Gauss-Newton method has high resolving power and convergence rate, and demonstrate potential applications to real seismic data.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• 제19권3호
• /
• pp.119-126
• /
• 2005

Electrical resistance tomography(ERT) maps resistivity values of the soil subsurface and characterizes buried objects. The characterization includes location, size and resistivity of buried objects. In this paper, Gauss-Newton, truncated least squares(TLS) and simultaneous iterative reconstruction technique(SIRT) methods are presented for the solution of the ERT image reconstruction. Computer simulations show that the spatial resolution of the reconstructed images by the TLS approach is improved as compared to those obtained by the Gauss-Newton and SIRT method.

• The Pure and Applied Mathematics
• /
• 제17권4호
• /
• pp.307-319
• /
• 2010

We provide a new semilocal convergence analysis of the Gauss-Newton method (GNM) for solving nonlinear equation in the Euclidean space. Using our new idea of recurrent functions, and a combination of center-Lipschitz, Lipschitz conditions, we provide under the same or weaker hypotheses than before [7]-[13], a tighter convergence analysis. The results can be extented in case outer or generalized inverses are used. Numerical examples are also provided to show that our results apply, where others fail [7]-[13].

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제44권6호
• /
• pp.1-8
• /
• 2007

In this paper, research on joint optimization of the image spatial registration and the exposure compensation is conducted. The exposure compensation is performed in a frame work of the intensity compensation based on the polynomial approximation of the relationship between images. This compensation is jointly combined with the registration problem employing the Gauss-Newton nonlinear optimization method. In this paper, to perform for a simple and stable optimization, the block-coordinate method is combined with the Gauss-Newton optimization and extensively compared with the traditional approaches. Furthermore, regression analysis is considered in the compensation part for a better stable performance. By combining the block-coordinate method with the Gauss-Newton optimization, we can obtain a compatible performance reducing the computational complexity and stabilizing the performance. In the numerical result for a particular image, we obtain a satisfactory result for 10 repeats of the iteration, which implies a 50% reduction of the computational complexity. The error is also further reduced by 1.5dB compared to the ordinary method.