• Bulletin of the Korean Mathematical Society
• /
• v.41 no.1
• /
• pp.125-135
• /
• 2004

One of the intriguing and fundamental algorithmic graph problems is the computation of the strongly connected components of a directed graph G. In this paper we first introduce a simple procedure for determining the location of the nonzero elements occurring in $B^{-1}$ without fully inverting B, where EB\;{\equiv}\;(b_{ij)\;and\;B^T$ are diagonally dominant matrices with $b_{ii}\;>\;0$ for all i and $b_{ij}\;{\leq}\;0$, for $i\;{\neq}\;j$, and then, as an application, show that all of the strongly connected components of a directed graph G can be recognized by the location of the nonzero elements occurring in the matrix $C(G)\;=\;(D\;-\;A(G))^{-1}$. Here A(G) is an adjacency matrix of G and D is an arbitrary scalar matrix such that (D - A(G)) becomes a diagonally dominant matrix.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.216-220
• /
• 1989

Direct calculation algorithm for the elements of A matrix is suggested for a single machine connected to the infinite bus. Excitation system and power system stabilizer are included. When A matrix is partitioned into seven submatrices, we can identify the location of non-zero elements and formula for each element. No matrix inversion and multiplication are necessary.

• 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.

• Communications of the Korean Mathematical Society
• /
• v.15 no.4
• /
• pp.587-595
• /
• 2000

We contain a simple construction for the sparse n x n connected orthogonal matrices which have a row of p nonzero entries with 2$\leq$p$\leq$n. Moreover, we study the analogous sparsity problem for an m x n connected row-orthogonal matrices.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1538-1543
• /
• 2018

For n pairs of points (a,b) on a circle, the line segment to connect two points is called a chord. These chords define a new graph G. Each chord corresponds to a vertex of G, and if two chords intersect, the two vertices corresponding to them are connected by an edge. This makes a graph, called by a circle graph. In this paper, we deal with the problem to find the connected components of a circle graph. The connected component of a graph G is a maximal subgraph H such that any two vertices in H can be connected by a path. When the adjacent matrix of G is given, the problem to find them can be solved by either the depth-first search or the breadth-first search. But when only the information for the chords is given as an input, it takes ${\Omega}(n^2)$ time to obtain the adjacent matrix. In this paper, we do not make the adjacent matrix and develop an $O(n{\log}^2n)$ algorithm for the problem.

• Proceedings of the KIPE Conference
• /
• 2020.08a
• /
• pp.381-382
• /
• 2020

In the battery energy storage system, battery cells are connected in series to increase the operating voltage. Due to the difference in characteristics, the performance degradation of cells is dissimilar. This paper proposes an online DC internal impedance estimation for battery cells in the series string using a matrix-switched capacitor converter, which is already verified as useful for the series balancing of the cells. The simulation in the hardware in the loop test rig shows good accuracy and the feasibility of the proposed method.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.19 no.6
• /
• pp.538-548
• /
• 2014

This study provides a robust control of a grid-connected three-phase two-level photo voltaic inverter. The introduced control method uses the cascade control strategy to regulate AC-side current and DC-link voltage. A robust controller with integration action is used for the inner-loop AC-side current control, which maximizes the convergence rate using a linear matrix inequality-based optimization design method and eliminates the offset error. The robust controller design method considers the parameter uncertainty set to accommodate parameter mismatch and un-modeled components in the inverter model. An outer-loop proportional-integral controller is used to regulate DC-link voltage with linearization of DC/AC relation. The proposed control strategy is applied to a grid-connected 100 kW photo voltaic inverter.

• Korean Journal of Mathematics
• /
• v.14 no.1
• /
• pp.47-55
• /
• 2006

This paper presents an image analysis technique using connected components by applying SPA (shortest path algorithm) from graph theory. Software implementation of Floyd-Warshall transitive matrix labelling method is discussed. Results are also presented.

• Journal of Integrative Natural Science
• /
• v.10 no.2
• /
• pp.110-114
• /
• 2017

The connected and simply connected four-dimensional matrix solvable Lie group $Sol^4_1$ is the four-dimensional geometry. A crystallographic group of $Sol^4_1$ is a discrete cocompact subgroup of $Sol^4_1{\rtimes}D(4)$. In this paper, we geometrically describe the crystallographic groups of $Sol^4_1$.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1135-1143
• /
• 2019

The matrix representation of the Toeplitz operator on the Hardy space with respect to a generalized orthonormal basis for the space of square integrable functions associated to a bounded simply connected region in the complex plane is completely computed in terms of only the Szegő kernel and the Garabedian kernels.