• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.169-180
• /
• 2006

We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient matrix is a symmetric positive definite matrix which is not an H-matrix. Next, we study the validity of m-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1302-1309
• /
• 2008

Traditional clustering methods, like k-means or fuzzy clustering, are prototype-based methods which are applicable only to convex clusters. On the other hand, spectral clustering tries to find clusters only using local similarity information. Its ability to handle concave clusters has gained the popularity recent years together with support vector machine (SVM) which is a kernel-based classification method. However, as is in SVM, the kernel width plays an important role and has a great impact on the result. Several methods are proposed to decide it automatically, it is still determined based on heuristics. In this paper, we proposed an adaptive method deciding the kernel width based on distance histogram. The proposed method is motivated by the fact that the affinity matrix should be formed into a block diagonal matrix to generate the best result. We use the tradition Euclidean distance together with the random walk distance, which make it possible to form a more apparent block diagonal affinity matrix. Experimental results show that the proposed method generates more clear block structured affinity matrix than the existing one does.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.988-991
• /
• 1996

The purpose of this thesis is to develop methods of designing robust LQR/LQG controllers for time-varying systems with real parametric uncertainties. Controller design that meet desired performance and robust specifications is one of the most important unsolved problems in control engineering. We propose a new framework to solve these problems using Linear Matrix Inequalities (LMls) which have gained much attention in recent years, for their computational tractability and usefulness in control engineering. In Robust LQR case, the formulation of LMI based problem is straightforward and we can say that the obtained solution is the global optimum because the transformed problem is convex. In Robust LQG case, the formulation is difficult because the objective function and constraint are all nonlinear, therefore these are not treatable directly by LMI. We propose a sequential solving method which consist of a block-diagonal approach and a full-block approach. Block-diagonal approach gives a conservative solution and it is used as a initial guess for a full-block approach. In full-block approach two LMIs are solved sequentially in iterative manner. Because this algorithm must be solved iteratively, the obtained solution may not be globally optimal.

• The Korean Journal of Applied Statistics
• /
• v.35 no.4
• /
• pp.569-577
• /
• 2022

Simulation studies are often conducted when it is difficult to compare the performance of nonparametric estimators theoretically. Kim and Kim (2021) showed that more systematic and accurate comparisons can be made if you analyze the simulation results using a regression model,. This study is a complementary study on Kim and Kim (2021). In the variance-covariance matrix for the error term of the regression model, only heteroscedasticity was considered and covariance was ignored in the previous study. When covariance is considered together with the heteroscedasticity, the variance-covariance matrix becomes a block diagonal matrix. In this study, a method of estimating and using the block diagonal variance-covariance matrix for the analysis was presented. This allows you to find more pairs of estimators with significant performance differences while ensuring the nominal confidence level.

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.41-49
• /
• 2024

This paper proposes dual symbol superposition block carrier transmission with frequency domain equalization (DSS-FDE) system. This system is based upon χ-transform matrix, which is obtained by concatenation of discrete Hartley transform (DHT) matrix and discrete Fourier transform (DFT) matrices into single matrix that is remarkably sparse, so that, as it will be shown in this paper, it only has non-zero entries on its principal diagonal and one below the principle anti-diagonal, giving it shape of Latin alphabet χ. When multiplied with constellation mapped complex transmit vector, each entry of resultant vector is weighted superposition of only two entries of original vector, as opposed to all entries in conventional DFT based OFDM. Such a transmitter is close to single carrier block transmission with frequency domain equalization (SC-FDE), which is known to have no superposition. The DSS-FDE offers remarkable simplicity in transmitter design and yields great benefits in reduced complexity and low PAPR. At receiver-end, it offers the ability to harvest full diversity from multipath fading channel, full coding gain, with significant bit error rate (BER) improvement. These results will be demonstrated using both analytical expressions, as well as simulation results. As will be seen, this paper is Part III of three-paper series on alternative transforms for multicarrier communication (MC) systems.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.91-111
• /
• 2007

In this paper an effective two-phase approach adopting modified p-median mathematical model is proposed for grouping machines and parts in cellular manufacturing(CM). Unlike the conventional methods allowing machines and parts to be improperly assigned to cells and families, the proposed approach seeks to find the proper block diagonal solution where all the machines and parts are properly assigned to their most associated cells and families in term of the actual machine processing and part moves. Phase 1 uses the modified p-median formulation adopting new inter-machine similarity coefficient based on the non-binary production data-based part-machine incidence matrix(PMIM) that reflects both the operation sequences and production volumes for the parts to find machine cells. Phase 2 apollos iterative reassignment procedure to minimize inter-cell part moves and maximize within-cell machine utilization by reassigning improperly assigned machines and parts to their most associated cells and families. Computational experience with the data sets available on literature shows the proposed approach yields good-quality proper block diagonal solution.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.3
• /
• pp.267-282
• /
• 2019

This paper examines how one can build a block tridiagonal structure for k-almost normal matrices and also for k-almost conjugate normal matrices. We shall see that these representations are created by unitary similarity and unitary congruance transformations, respectively. It shall be proven that the orders of diagonal blocks are 1, k + 2, 2k + 3, ${\ldots}$, in both cases. Then these block tridiagonal structures shall be reviewed for the cases where the mentioned matrices satisfy in a second-degree polynomial. Finally, for these processes, algorithms are presented.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.199-211
• /
• 2004

For positive integers $\kappa$ and p$\geq$3, let(equation omitted) where $J_{p}$ is the p${\times}$p matrix whose entries are all 1. Then, we determine the minimum permanents and minimizing matrices over (1) the face of $\Omega$(D) and (2) the face of $\Omega$($D^{*}$), where (equation omitted).

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.227-234
• /
• 2001

In this paper we propose a block-type parallel preconditioner for solving large sparse nonsymmetric linear systems, which we expect to be scalable. It is Multi-Color Block SOR preconditioner, combined with direct sparse matrix solver. For the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with Multi-Color ordering. Since most of the time is spent on the diagonal inversion, which is done on each processor, we expect it to be a good scalable preconditioner. We compared it with four other preconditioners, which are ILU(0)-wavefront ordering, ILU(0)-Multi-Color ordering, SPAI(SParse Approximate Inverse), and SSOR preconditiner. Experiments were conducted for the Finite Difference discretizations of two problems with various meshsizes varying up to $1025{\times}1024$. CRAY-T3E with 128 nodes was used. MPI library was used for interprocess communications, The results show that Multi-Color Block SOR is scalabl and gives the best performances.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.898-902
• /
• 2003

For linear descriptor systems, we consider the $H_{INFTY}$ controller design problem via output feedback. Both static output feedback and dynamic one are discussed. First, in the case of static output feedback, we reduce our control problem to solving a bilinear matrix inequality (BMI) with respect to the controller coefficient matrix, a Lyapunov matrix and a matrix related to the descriptor matrix. Under a matching condition between the descriptor matrix and the measured output matrix (or the control input matrix), we propose setting the Lyapunov matrix in the BMI as being block diagonal appropriately so that the BMI is reduced to LMIs. For fixed-order dynamic $H_{INFTY}$ output feedback, we formulate the control problem equivalently as the one of static output feedback design, and thus the same approach can be applied.