• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.7 no.4
• /
• pp.328-335
• /
• 1996

The numerical dispersive characteristics and the numerical stability confition of the Multi-Resolution Time-Domain(MRTD) method are calculated. A dispersion analysis of the MRTD schemes including a comparison to Yee's Finite-Difference Time-Domain(FDTD) method is given. The superiority of the MRTD method to the spatial discretization is shown. The required computational memory can be reduced by using the MRTD method. We expect that the MRTD method will be very useful method for numerical modelling of electromagnetics.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.44-48
• /
• 2009

This paper develops a methodology for resizing image resolutions in an arbitrary block transform domain. To accomplish this, we represent the procedures resizing images in an arbitrary transform domain in the form of matrix multiplications from which the matrix scaling the image resolutions is produce. The experiments showed that the proposed method produces the reliable performances without increasing the computational complexity, compared to conventional methods when applied to various transforms.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.180-185
• /
• 2008

A new method for relative error continuous and discrete time model order reduction is proposed. The reduction technique is based on two recently developed methods, namely frequency domain balanced truncation within a frequency bound and inner-outer factorization techniques. The proposed method is of interest for practical model order reduction because in this context it shows to keep the accuracy of the approximation as high as possible without sacrificing the computational efficiency. Numerical results show the accuracy and efficiency enhancement of the method.

• Journal of computational fluids engineering
• /
• v.21 no.1
• /
• pp.10-18
• /
• 2016

Numerical boundary conditions are as important as the governing equations when analyzing the fluid flows numerically. An explicit boundary condition method updates the solutions at the boundaries with extrapolation from the interior of the computational domain, while the implicit boundary condition method in conjunction with an implicit time integration method solves the solutions of the entire computational domain including the boundaries simultaneously. The implicit boundary condition method, therefore, is more robust than the explicit boundary condition method. In this paper, steady compressible 2-Dimensional Navier-Stokes solver is developed. We present the implicit boundary condition method coupled with LU-SGS(Lower Upper Symmetric Gauss Seidel) method. Also, the explicit boundary condition method is implemented for comparison. The preconditioning Navier-Stokes equations are solved on unstructured meshes. The numerical computations for a number of flows show that the implicit boundary condition method can give accurate solutions.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.29-36
• /
• 2009

Domain mapping is a bijective transformation of one domain to another, usually from a complicated general domain to a chosen convex domain. This is directly useful in many application problems like shape modeling, morphing, texture mapping, shape matching, remeshing, path planning etc. A new approach considering the domain as made up of structural elements, like membranes or trusses, is developed and implemented using the nonlinear finite element formulation. The mapping is performed in two stages, boundary mapping and inside mapping. The boundary of the 3-D domain is mapped to the surface of a convex domain (in this case, a sphere) in the first stage and then the displacement/distortion of this boundary is used as boundary conditions for mapping the interior of the domain in the second stage. This is a general method and it develops a bijective mapping in all cases with judicious choice of material properties and finite element analysis. The consistent global parameterization produced by this method for an arbitrary genus zero closed surface is useful in shape modeling. Results are convincing to accept this finite element structural approach for domain mapping as a good method for many purposes.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.1 s.173
• /
• pp.240-249
• /
• 2000

An improved global optimization algorithm is developed by extending the domain elimination method. The concept of triangular patch consists of two or more trajectories of local minimizations is introduced to widen the attraction region of the domain elimination method. Using the an-]c between each of three vertices of the patch and a design point, we measure the proximity, between the design point and the patch. With the Gram-Schimidt orthonormalization, this method can be extended to general n-dimensional problems. We code the original domain elimination algorithm and a patch-based algorithm. Then we compare the performance of two algorithms. Through the well-known example problems. the algorithm using patch is shown to be superior to the original domain elimination algorithm in view of computational efficiency.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.183-194
• /
• 2003

We will explain a new method for obtaining the nearly optimal domain for optimal shape design problems associated with the solution of a nonlinear wave equation. Taking into account the boundary and terminal conditions of the system, a new approach is applied to determine the optimal domain and its related optimal control function with respect to the integral performance criteria, by use of positive Radon measures. The approach, say shape-measure, consists of two steps; first for a fixed domain, the optimal control will be identified by the use of measures. This function and the optimal value of the objective function depend on the geometrical variables of the domain. In the second step, based on the results of the previous one and by applying some convenient optimization techniques, the optimal domain and its related optimal control function will be identified at the same time. The existence of the optimal solution is considered and a numerical example is also given.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.75-83
• /
• 2007

Orthogonal frequency division multiplexing (OFDM) systems with multiple transmit antennas can exploit space-time block coding on each subchannel for reliable data transmission. Spacetime coded OFDM systems, however, are very sensitive to time variant channels because the channels need to be static over multiple OFDM symbol periods. In this paper, we propose to mitigate the channel variations in the frequency domain using a linear filter in the frequency domain that exploits the sparse structure of the system matrix in the frequency domain. Our approach has reduced complexity compared with alternative approaches based on time domain block-linear filters. Simulation results demonstrate that our proposed frequency domain block-linear filter reduces computational complexity by more than a factor of ten at the cost of small performance degradation, compared with a time domain block-linear filter.

• International Journal of CAD/CAM
• /
• v.11 no.1
• /
• pp.11-17
• /
• 2011

A new method has been developed in this paper for automatic quadrilateral mesh generation for a two-dimensional domain. The method is named 'centering method' because it centers a point at the domain and then divides it into sub-domains using cutting lines from the center point. Each of the cutting lines is selected based on the criterion using the angles between the boundary of the domain and the cutting line. The decomposition of the domain into sub-domains is repeated until every subdomain has four or six nodes. Pre-defined splitters are used to divide six-node domains into quadrilateral elements depending on their configuration and presence on the boundary of the initial domain. Arbitrary domains are meshed as examples to verify the robustness of the new method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.6
• /
• pp.469-476
• /
• 2012

In this paper, a finite element domain decomposition method using local and mixed Lagrange multipliers for a large scal structural analysis is presented. The proposed algorithms use local and mixed Lagrange multipliers to improve computational efficiency. In the original FETI method, classical Lagrange multiplier technique was used. In the dual-primal FETI method, the interface nodes are used at the corner nodes of each sub-domain. On the other hand, the proposed FETI-local analysis adopts localized Lagrange multipliers and the proposed FETI-mixed analysis uses both global and local Lagrange multipliers. The numerical analysis results by the proposed algorithms are compared with those obtained by dual-primal FETI method.