• East Asian mathematical journal
• /
• v.36 no.1
• /
• pp.61-71
• /
• 2020

Up to the present day, the best solution we can get to the truncated moment problem (TMP) is probably the Flat Extension Theorem. It says that if the corresponding moment matrix of a moment sequence admits a rank-preserving positive extension, then the sequence has a representing measure. However, constructing a flat extension for most higher-order moment sequences cannot be executed easily because it requires to allow many parameters. Recently, the author has considered various decompositions of a moment matrix to find a solution to TMP instead of an extension. Using a new approach with the Hadamard product, the author would like to introduce more techniques related to moment matrix decompositions.

• The Pure and Applied Mathematics
• /
• v.13 no.4 s.34
• /
• pp.281-294
• /
• 2006

Many partial differential equations defined on a rectangular domain can be solved numerically by using a domain decomposition method. The most commonly used decompositions are the domain being decomposed in stripwise and rectangular way. Theories for non-overlapping domain decomposition(in which two adjacent subdomains share an interface) were often focused on the stripwise decomposition and claimed that extensions could be made to the rectangular decomposition without further discussions. In this paper we focus on the comparisons of the two ways of decompositions. We consider the unconditionally stable scheme, the MIP algorithm, for solving parabolic partial differential equations. The SOR iterative method is used in the MIP algorithm. Even though the theories are the same but the performances are different. We found out that the stripwise decomposition has better performance.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.3
• /
• pp.139-170
• /
• 2013

We extend a p-hierarchical decomposition of the second degree finite element space of N$\acute{e}$d$\acute{e}$lec for tetrahedral meshes in three dimensions given in [1] to meshes with hexahedral elements, and derive p-hierarchical decompositions of the second degree finite element space of Raviart-Thomas in two dimensions for triangular and quadrilateral meshes. After having proved stability of these subspace decompositions and requiring certain saturation assumptions to hold, we construct a local a posteriori error estimator for fem and bem coupling of a time-harmonic electromagnetic eddy current problem in $\mathbb{R}^3$. We perform some numerical tests to underline reliability and efficiency of the estimator and test its usefulness in an adaptive refinement scheme.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.149-163
• /
• 2018

In recent years, the study of slice Dirac operators has attracted more and more attention in the literature. In this paper, Almansitype decompositions for null solutions to the iterated slice Dirac operator and the generalized slice Dirac operator are obtained without a star-like domain centered at the origin. As applications, we investigate Riquier type problems and Dirichlet type problems in the theory of slice monogenic functions.

• Communications for Statistical Applications and Methods
• /
• v.14 no.1
• /
• pp.215-227
• /
• 2007

Variable selection algorithm for Sliced Inverse Regression using penalty function is proposed. We noted SIR models can be expressed as generalized eigenvalue decompositions and incorporated penalty functions on them. We found from small simulation that the HARD penalty function seems to be the best in preserving original directions compared with other well-known penalty functions. Also it turned out to be effective in forcing coefficient estimates zero for irrelevant predictors in regression analysis. Results from illustrative examples of simulated and real data sets will be provided.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.33-43
• /
• 1998

Matlis posed the following question in 1958: if N is a direct summand of a direct sum M of indecomposable injectives, then is N itself a direct sum of indecomposable innjectives\ulcorner It will be proved that the Matlis problem has an affirmative answer when M is a multiplication module, and that a weaker condition then that of M being a multiplication module can be given to module M when M is a countable direct sum of indecomposable injectives.

• Journal of The Korean Association of Information Education
• /
• v.20 no.6
• /
• pp.553-562
• /
• 2016

Although software education pursues developing learners' computational thinking skills, more studies are needed in terms of designing software education lessons to enhance CT skills and to measure the effects of the lessons. This study aims to investigate the effects of a course designed to enhance pre-service teachers' CT skills by using CT-based teaching materials. Through a literature review the study has selected the five core competencies of CT: algorithmic thinking, evaluation, problem decompositions, abstraction, and generalization. The participants of the study are 47 pre-service teachers who took the one-semester course in a national university of education. A survey was developed and conducted and qualitative analyses on the team projects were performed focusing on the core competencies of CT. The results revealed pre-service teachers' perceived degree of experiencing CT and their competencies represented in their projects. The present study provides important implications to future software education programs in terms of designing and implementing of software education.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.159-165
• /
• 2005

This paper designs observers for matrix second-order linear systems on the basis of generalized eigenstructure assignment via unified parametric approach. It is shown that the problem is closely related with a type of so-called generalized matrix second-order Sylvester matrix equations. Through establishing two general parametric solutions to this type of matrix equations, two unified complete parametric methods for the proposed observer design problem are presented. Both methods give simple complete parametric expressions for the observer gain matrices. The first one mainly depends on a series of singular value decompositions, and is thus numerically simple and reliable; the second one utilizes the right factorization of the system, and allows eigenvalues of the error system to be set undetermined and sought via certain optimization procedures. A spring-mass system is utilized to show the effect of the proposed approaches.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.3
• /
• pp.419-429
• /
• 2005

This paper considers eigenstructure assignment in high-order linear systems via proportional plus derivative feedback. It is shown that the problem is closely related with a type of so-called high-order Sylvester matrix equations. Through establishing two general parametric solutions to this type of matrix equations, two complete parametric methods for the proposed eigenstructure assignment problem are presented. Both methods give simple complete parametric expressions for the feedback gains and the closed-loop eigenvector matrices. The first one mainly depends on a series of singular value decompositions, and is thus numerically very simple and reliable; the second one utilizes the right factorization of the system, and allows the closed-loop eigenvalues to be set undetermined and sought via certain optimization procedures. An example shows the effect of the proposed approaches.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.195-201
• /
• 2007

A minimum terminal path decomposition of a tree is defined as a partition of the tree into edge-disjoint terminal-to-terminal paths that minimizes the weight of the longest path. In this paper, we present an $O({\mid}V{\mid}^2$time algorithm to find a minimum terminal path decomposition of trees. The algorithm reduces the given optimization problem to the binary search using the corresponding decision problem, the problem to decide whether the cost of a minimum terminal path decomposition is at most l. This decision problem is solved by dynamic programing in a single traversal of the tree.