• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.8
• /
• pp.1429-1437
• /
• 1992

A new finite element formulation based on the relaxation type hereditary integral is presented for a time-domain analysis of isotropic, linear viscoelastic problems. The semi-discrete variational approximation and elastic-viscoelastic correspondence principle are used in the theoretical development of the proposed method. In a time-stepping procedure of final, linear algebraic system equations, only a small additional computation for past history is required since the equivalent stiffness matrix is constant. The viscoelasticity matrices are derived and the stress computation algorithm is given in matrix form. The effect of time increment and Gauss point numbers on the numerical accuracy is examined. Two dimensional numerical examples of plane strain and plane stress are solved and compared with the analytical solutions to demonstrate the versatility and accuracy of the present method.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.1 no.1
• /
• pp.72-74
• /
• 1983

Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.

• Geophysics and Geophysical Exploration
• /
• v.1 no.2
• /
• pp.127-135
• /
• 1998

The Born approximation is widely used for solving the complex scattering problems in electromagnetics. Approximating total internal electric field by the background field is reasonable for small material contrasts as long as scatterer is not too large and the frequency is not too high. However in many geophysical applications, moderate and high conductivity contrasts cause both real and imaginary part of internal electric field to differ greatly from background. In the extended Born approximation, which can improve the accuracy of Born approximation dramatically, the total electric field in the integral over the scattering volume is approximated by the background electric field projected to a depolarization tensor. The finite difference and elements methods are usually used in EM scattering problems with a 2D model and a 3D source, due to their capability for simulating complex subsurface conductivity distributions. The price paid for a 3D source is that many wavenumber domain solutions and their inverse Fourier transform must be computed. In these differential equation methods, all the area including homogeneous region should be discretized, which increases the number of nodes and matrix size. Therefore, the differential equation methods need a lot of computing time and large memory. In this study, EM modeling program for a 2D model and a 3D source is developed, which is based on the extended Born approximation. The solution is very fast and stable. Using the program, crosshole EM responses with a vertical magnetic dipole source are obtained and the results are compared with those of 3D integral equation solutions. The agreement between the integral equation solution and extended Born approximation is remarkable within the entire frequency range, but degrades with the increase of conductivity contrast between anomalous body and background medium. The extended Born approximation is accurate in the case conductivity contrast is lower than 1:10. Therefore, the location and conductivity of the anomalous body can be estimated effectively by the extended Born approximation although the quantitative estimate of conductivity is difficult for the case conductivity contrast is too high.

• Geophysics and Geophysical Exploration
• /
• v.7 no.1
• /
• pp.51-55
• /
• 2004

This paper presents a fast and stable imaging scheme using the localized nonlinear (LN) approximation of integral equation (IE) solutions for inverting electromagnetic data obtained in a crosswell survey. The medium is assumed to be cylindrically symmetric about a source borehole, and to maintain the symmetry a vertical magnetic dipole is used as a source. To find an optimum balance between data fitting and smoothness constraint, we introduce an automatic selection scheme for a Lagrange multiplier, which is sought at each iteration with a least misfit criterion. In this selection scheme, the IE algorithm is quite attractive for saving computing time because Green's functions, whose calculation is a most time-consuming part in IE methods, are repeatedly re-usable throughout the inversion process. The inversion scheme using the LN approximation has been tested to show its stability and efficiency, using both synthetic and field data. The inverted image derived from the field data, collected in a pilot experiment of water-flood monitoring in an oil field, is successfully compared with that derived by a 2.5-dimensional inversion scheme.

• Geophysics and Geophysical Exploration
• /
• v.11 no.1
• /
• pp.60-67
• /
• 2008

In this paper we consider an application of the method of electromagnetic (EM) migration to the interpretation of a typical marine controlled-source (MCSEM) survey consisting of a set of sea-bottom receivers and a moving electrical bipole transmitter. Three-dimensional interpretation of MCSEM data is a very challenging problem because of the enormous number of computations required in the case of the multi-transmitter and multi-receiver data acquisition systems used in these surveys. At the same time, we demonstrate that the MCSEM surveys with their dense system of transmitters and receivers are extremely well suited for application of the migration method. In order to speed up the computation of the migration field, we apply a fast form of integral equation (IE) solution based on the multigrid quasi-linear (MGQL) approximation which we have developed. The principles of migration imaging formulated in this paper are tested on a typical model of a sea-bottom petroleum reservoir.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.902-915
• /
• 2011

Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.

• Journal of the Korean Geophysical Society
• /
• v.5 no.1
• /
• pp.63-71
• /
• 2002

The integral equation method is a powerful tool for electromagnetic numerical modeling. But the difficulty of this technique is the size of their linear equations, which demands excessive memory and calculation time to invert. This limitation of the integral equation method becomes critical in inverse problem. To overcome this limitation, a lot of approximation and series methods, such as conventional Born, modifed Born and extended Born, were developed. But all the methods need volume integration of Green tensor, which is very time consuming. In electromagnetic theory, Green tensor rapidly decreases as the distance between source and field cell increases. Therefore, the source cell which are far away from the field cell does not make an effect on the electric field of the field cell. Consequently, by ignoring the effect of Green tensor due to far away source cells, computing time for electromagnetic numerical modeling can be reduced dramatically. Comparisons of this new method against a full integral equation, extended Born approximation and series code show that the method is accurate enough much less time consuming.

• Journal of the Optical Society of Korea
• /
• v.18 no.6
• /
• pp.706-713
• /
• 2014

An enhanced 360-degree integral-floating three-dimensional display system using a hexagonal lens array and a hidden point removal operator is proposed. Only the visible points of the chosen three-dimensional point cloud model are detected by the hidden point removal operator for each rotating step of the anamorphic optics system, and elemental image arrays are generated for the detected visible points from the corresponding viewpoint. Each elemental image of the elemental image array is generated by a hexagonal grid, due to being captured through a hexagonal lens array. The hidden point removal operator eliminates the overlap problem of points in front and behind, and the hexagonal lens array captures the elemental image arrays with more accurate approximation, so in the end the quality of the displayed image is improved. In an experiment, an anamorphic-optics-system-based 360-degree integral-floating display with improved image quality is demonstrated.

• The Korean Journal of Applied Statistics
• /
• v.18 no.1
• /
• pp.57-66
• /
• 2005

In this paper, we propose a method to evaluate the solutions of the renewal equations related to SPRT for Erlang distribution. In SPRT, the Average Sample Number(ASN) and type I or type II error probabilities are shown in Fredholm type integral equations. The integral equations are generally solved by the approximation method using Gaussian quadrature. For Erlang distribution, it has been known that the exact solutions of the equations exist. We propose the algorithm to solve the equations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.191-198
• /
• 2003

The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.