• East Asian mathematical journal
• /
• v.37 no.3
• /
• pp.295-305
• /
• 2021

In this paper, we analyze the efficiency of a domain decomposition method for the two-dimensional telegraph equations. We formulate the theoretical spectral radius of the iteration matrix generated by the domain decomposition method, because the rate of convergence of an iterative algorithm depends on the spectral radius of the iteration matrix. The theoretical spectral radius is confirmed by the experimental one using MATLAB. Speedup and operation ratio of the domain decomposition method are also compared as the two measurements of the efficiency of the method. Numerical results support the high efficiency of the domain decomposition method.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2007.06a
• /
• pp.329-336
• /
• 2007

For scaling of the gradient of misfit function, we develop a new pseudo-Hessian matrix constructed by combining amplitude field and pseudo-Hessian matrix. Since pseudo- Hessian matrix neglects the calculation of the zero-lag auto-correlation of impulse responses in the approximate Hessian matrix, the pseudo-Hessian matrix has a limitation to scale the gradient of misfit function compared to the approximate Hessian matrix. To validate the new pseudo- Hessian matrix, we perform frequency-domain elastic full waveform inversion using this Hessian matrix. By synthetic experiments, we show that the new pseudo-Hessian matrix can give better convergence to the true model than the old one does. Furthermore, since the amplitude fields are intrinsically obtained in forward modeling procedure, we do not have to pay any extra cost to compute the new pseudo-Hessian. We think that the new pseudo-Hessian matrix can be used as an alternative of the approximate Hessian matrix of the Gauss-Newton method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.372-379
• /
• 2015

The latest video compression standard (such as H.264/AVC and HEVC) utilizes quarter-pel accuracy motion estimation in order to retain detailed motion information. Many sub-pixel motion estimation algorithms used in the spatial domain usually encounters increment of computational complexity due to embedded interpolation algorithm. In this paper, an approach to measure sub-pixel accuracy motion estimation in frequency domain using shifting matrix is proposed. Complexity can be reduced utilizing shifting matrix algorithm in frequency domain and simulation results demonstrate not only higher PSNR but lower bit rates than spatial domain algorithms.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1997.10a
• /
• pp.42-49
• /
• 1997

In this paper, the method for soil-structure interaction analyses in the time domain is proposed. The far field soil region which is the outside of the artificial boundary is modeled by using explicit frequency-dependent two dimensional infinite elements which can include multiple wave components propagating into the unbounded medium. Since the dynamic stiffness matrix of the far field soil region using the proposed infinite elements is obtained explicitly in terms of exciting frequencies and constants in the frequency domain, the matrix can be easily transformed into the displacement unit-impulse response matrix, which corresponds to a convolution integral of it in the time domain. To verify the proposed method for soil-structure interaction analyses in the time domain, the displacement responses due to an impulse load on the surface of a soil layer with the rigid bed rock are compared with those obtained by the method in the frequency domain and those by models with extend finite element meshes. Good agreements have been found between them.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.20 no.4
• /
• pp.27-34
• /
• 2016

A new algorithm for determining optimal accelerometer locations is proposed by using a frequency-domain Hankel matrix which is much simpler to construct than a time-domain Hankel matrix. The algorithm was examined through simulation studies by comparing the outcomes with those from other available methods. To compare and analyze the results from different methods, a dynamic analysis was carried out under seismic excitation and acceleration data were obtained at the selected optimal sensor locations. Vibrational amplitudes at the selected sensor locations were determined and those of all the other degrees of freedom were determined by using a spline function. MAC index of each method was calculated and compared to look at which method could determine more effective locations of accelerometers. The proposed frequency-domain Hankel matrix could determine reasonable selection of accelerometer locations compared with the others.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.5-23
• /
• 2002

Motivation: Protein-protein interaction plays a critical role in the biological processes. The identification of interacting proteins by bioinformatical methods can provide new lead In the functional studies of uncharacterized proteins without performing extensive experiments. Results: Protein-protein interactions are predicted by a computational algorithm based on the weighted scoring system for domain interactions between interacting protein pairs. Here we propose potential interaction domain (PID) pairs can be extracted from a data set of experimentally identified interacting protein pairs. where one protein contains a domain and its interacting protein contains the other. Every combinations of PID are summarized in a matrix table termed the PID matrix, and this matrix has proposed to be used for prediction of interactions. The database of interacting proteins (DIP) has used as a source of interacting protein pairs and InterPro, an integrated database of protein families, domains and functional sites, has used for defining domains in interacting pairs. A statistical scoring system. named "PID matrix score" has designed and applied as a measure of interaction probability between domains. Cross-validation has been performed with subsets of DIP data to evaluate the prediction accuracy of PID matrix. The prediction system gives about 50% of sensitivity and 98% of specificity, Based on the PID matrix, we develop a system providing several interaction information-finding services in the Internet. The system, named PreDIN (Prediction-oriented Database of Interaction Network) provides interacting domain finding services and interacting protein finding services. It is demonstrated that mapping of the genome-wide interaction network can be achieved by using the PreDIN system. This system can be also used as a new tool for functional prediction of unknown proteins.

• Journal of Mechanical Science and Technology
• /
• v.17 no.3
• /
• pp.329-335
• /
• 2003

EALQR (Linear Quadratic Regulate. design with Eigenstructure Assignment capability) has the capability of exact assignment of eigenstructure with the guaranteed margins of the LQR for MIMO (Multi-Input Multi-Output) systems. However, EALQR undergoes a restriction on the state-weighting matrix Q in LQR to be indefinite with respect to the region of allowable closedloop eigenvalues. The definiteness of the weighting matrix is closely related to the robustness property of a given system. In this paper, we derive a relation between the indefinite weighting matrix Q and the robustness property for EALQR. The modified frequency domain inequality, that could be guaranteed by EQLQR with an indefinite weighting matrix, is presented.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.115-123
• /
• 1997

In this paper we present a polynomial matrix decomposition algorithm that determines a polynomial matix M(z) which satisfies the relation V(z)=M(z) for a given polynomial matrix V(z) which is paraconjugate hermitian matrix with normal rank r and is positive semidenfinite on the unit circle of z-plane. All the decomposition procedures in this proposed method are performed in the digitral domain. We also discuss how to apply the polynomial matirx decomposition in realizing MIMO LBR two-pairs.

• Journal of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.973-986
• /
• 2020

In this paper, we compute the Hankel matrix representation of the Hankel operator on the Hardy space of a general bounded domain with respect to special orthonormal bases for the Hardy space and its orthogonal complement. Moreover we obtain the compact form of the Hankel matrix for the unit disc case with respect to these bases. One can see that the Hankel matrix generated by this computation turns out to be a generalization of the case of the unit disc from the single simply connected domain to multiply connected domains with much diversities of bases.

• Journal of KIISE:Software and Applications
• /
• v.36 no.10
• /
• pp.851-860
• /
• 2009

Recently, among the computational methods of protein-protein interaction prediction, vast amounts of domain based methods originated from domain-domain relation consideration have been developed. However, it is true that multi domains collaboration is avowedly ignored because of computational complexity. In this paper, we implemented a protein interaction prediction system based the Interaction Significance matrix, which quantified an influence of domain combination pair on a protein interaction. Unlike conventional domain combination methods, IS matrix contains weighted domain combinations and domain combination pair power, which mean possibilities of domain collaboration and being the main body on a protein interaction. About 63% of sensitivity and 94% of specificity were measured when we use interaction data from DIP, IntAct and Pfam-A as a domain database. In addition, prediction accuracy gradually increased by growth of learning set size, The prediction software and learning data are currently available on the web site.