• Smart Structures and Systems
• /
• v.14 no.6
• /
• pp.1197-1220
• /
• 2014

Accurate actuator tracking is critical to achieve reliable real-time hybrid simulation results for earthquake engineering research. The frequency-domain evaluation approach provides an innovative way for more quantitative post-simulation evaluation of actuator tracking errors compared with existing time domain based techniques. Utilizing the Fast Fourier Transform the approach analyzes the actuator error in terms of amplitude and phrase errors. Existing application of the approach requires using the complete length of the experimental data. To improve the computational efficiency, two techniques including data decimation and frequency decimation are analyzed to reduce the amount of data involved in the frequency-domain evaluation. The presented study aims to enhance the computational efficiency of the approach in order to utilize it for future on-line actuator tracking evaluation. Both computational simulation and laboratory experimental results are analyzed and recommendations on the two decimation factors are provided based on the findings from this study.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.1020-1026
• /
• 2016

Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

• Journal of computational fluids engineering
• /
• v.22 no.1
• /
• pp.51-58
• /
• 2017

A penalized VIC method offers an efficient hybrid particle-mesh algorithm to simulate an incompressible viscous flow passing a solid body in an infinite domain. In this manner, the computational domain needs to be restricted to a relatively small region to reduce computational cost which would be very high in case of using a large domain. In this paper, we present how to dispose of far-field particles to avoid an unnecessarily large computational domain. The present approach constraints expansion of the domain and thus prevents the incremental computational cost. To validate the numerical approach, a flow around an impulsively started sphere was simulated for Reynolds numbers of 100 and 1000.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.471-474
• /
• 2007

A domain/boundary decomposition technique is applied to carry out efficient finite element analyses of 3-D contact problems. Appropriate penalty functions are selected for connecting an interface and contact interfaces with neighboring subdomains that satisfy continuity constraints. As a consequence, all the effective stiffness matrices have positive definiteness, and computational efficiency can be improved to a considerable degree. If necessary, any complex-shaped 3-D domain can be divided into several simple-shaped subdomains without considering the conformity of meshes along the interface. With a set of numerical examples, the basic characteristics of computational efficiency are investigated carefully.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1188-1197
• /
• 1995

This paper describes an algorithm that reduces computational requirement of the Kalman filter and estimates the signal efficiently. The reference signals are mapped onto the orthogonal wavelet transform domain so that the eigenvalue spread of its autocorrelation matrix could be smaller than that in the time domain. In the wavelet transform domain the autocorrelation matrix is nearly diagonal. Therefore, the transformed signal can be decomposed each orthogonal elements. The Kalman filter can be applied to each orthogonal elements and computational requirement is reduced. The possibility of applying the parallel Kalman filter was verified through the theory and simulation. The eigenvalue spread in the wavelet transform domain is smaller 8.35 times than that in the time domain and the computational requirement is reduced from 1.4 times to 2. 93 times than that of the conventional Kalman filter.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.27-32
• /
• 2008

In the present study, a conservative overset mesh technique has been developed on 2-D unstructured meshes. A new domain connection technique between independent mesh blocks was proposed to satisfy the conservation of mass, momentum, or energy in entire computational domain. The present technique was applied to several classical computational problems to validate the superiority of the conservative method to the non-conservative method.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.27-32
• /
• 2008

In the present study, a conservative overset mesh technique has been developed on 2-D unstructured meshes. A new domain connection technique between independent mesh blocks was proposed to satisfy the conservation of mass, momentum, or energy in entire computational domain. The present technique was applied to several classical computational problems to validate the superiority of the conservative method to the non-conservative method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.1
• /
• pp.17-26
• /
• 2014

This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.158-162
• /
• 1996

Algorithms to find the Bezier control points of the image of a Bezier domain curve on a Bezier surface are described. The diagonal image curve is analysed and the general linear case is transformed to the diagonal case. This proposed algorithm gives the closed form solution to find the control points of the image curve of a linear domain curve. If the domain curve is not linear, the image curve can be obtained by solving the system of linear equations.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.2
• /
• pp.153-161
• /
• 2009

A domain/boundary decomposition method is applied for efficient analyses of thermo-elasto-viscoplastic damage and contact problems under the assumption of infinitesimal deformation. For the decomposition of a whole domain and contact boundaries, all the equality constraints on the interface and contact interfaces are restated with simple penalty functional. Therefore, the non-linearity of the problem is localized within finite element matrices in a few subdomains and on contact interfaces. By setting up suitable solution algorithms, the computational efficiency can be improved considerably. The general tendency of the computational efficiency is illustrated with some numerical experiments.