• Communications of the Korean Mathematical Society
• /
• v.12 no.2
• /
• pp.269-273
• /
• 1997

We show that each element in the semigroup $S_n$ of all $n \times n$ non-singular stochastic totally positive matrices is generated by the infinitesimal elements of $S_n$, which form a cone consisting of all $n \times n$ Jacobi intensity matrices.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.569-582
• /
• 2010

The following "Periodic Jacobi Procrustes" problem is studied: find the Periodic Jacobi matrix X which minimizes the Frobenius (or Euclidean) norm of AX - B, with A and B as given rectangular matrices. The class of Procrustes problems has many application in the biological, physical and social sciences just as in the investigation of elastic structures. The different problems are obtained varying the structure of the matrices belonging to the feasible set. Higham has solved the orthogonal, the symmetric and the positive definite cases. Andersson and Elfving have studied the symmetric positive semidefinite case and the (symmetric) elementwise nonnegative case. In this contribution, we extend and develop these research, however, in a relatively simple way. Numerical difficulties are discussed and illustrated by examples.

• The Pure and Applied Mathematics
• /
• v.18 no.3
• /
• pp.185-199
• /
• 2011

In this paper, we present a new extended Jacobi method for computing eigenvalues and eigenvectors of Hermitian matrices which does not use any complex arithmetics. This method can be readily applied to skew-Hermitian and real skew-symmetric matrices as well. An example illustrating its computational efficiency is given.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.99-112
• /
• 2012

This paper attempts to present a numerical method for solving optimal control problems. The method is based upon constructing the n-th degree Jacobi polynomials to approximate the control vector and use differentiation matrix to approximate derivative term in the state system. The system dynamics are then converted into system of algebraic equations and hence the optimal control problem is reduced to constrained optimization problem. Numerical examples illustrate the robustness, accuracy and efficiency of the proposed method.

• Communications of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.239-246
• /
• 2021

In this article, a study of generalized Bateman's matrix polynomials is presented. We obtained partial differential equations by using differential operators in the generalized Bateman's matrix polynomials for two variables. Then we introduced some different recurrence relationships of the generalized Bateman's matrix polynomials. Finally present the relationship between the generalized Bateman's matrix polynomials of one and two variables.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.627-647
• /
• 2015

In this paper, we construct the Schr$\ddot{o}$dinger-Weil representation of the Jacobi group associated with a positive definite symmetric real matrix of degree m and find covariant maps for the Schr$\ddot{o}$dinger-Weil representation.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.607-614
• /
• 2010

In this paper, we obtain geodesic formula of a certain class of Pseudoriemmanian 2-step nilpotent groups and show a constancy of represenation matrix of Jacobi oprerators along geodesics in Pseudoriemmanian 2-step nilpotent groups with one dimensional center.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.21-31
• /
• 2014

Singular value decomposition (SVD) has been widely used to identify unique features from a data set in various fields. However, a complex matrix calculation of SVD requires tremendous computation time. This paper improves the performance of a representative one-sided block Jacoby algorithm using a two-dimensional (2D) multi-core system. In addition, this paper explores an optimal multi-core system by varying the number of processing elements in the 2D multi-core system with the same 400MHz clock frequency and TSMC 28nm technology for each matrix-based one-sided block Jacoby algorithm ($128{\times}128$, $64{\times}64$, $32{\times}32$, $16{\times}16$). Moreover, this paper demonstrates the potential of the 2D multi-core system for the one-sided block Jacoby algorithm by comparing the performance of the multi-core system with a commercial high-performance graphics processing unit (GPU).

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.41-46
• /
• 2010

In this paper, the DoA(Direction of Arrival) estimator using unitary MUSIC algorithm is studied. The complex-valued correlation matrix of MUSIC algorithm is transformed to the real-valued one using unitary transform for easy implementation. The eigenvalue and eigenvector are obtained by the combined Jacobi-CORDIC algorithm. CORDIC algorithm can be implemented by only ADD and SHIFT operations and MUSIC spectrum computed by 256 point DFT algorithm. Results of unitary MUSIC algorithm designed by System Generator for FPGA implementation is entirely consistent with Matlab results. Its performance is evaluated through hardware co-simulation and resource estimation.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1893-1908
• /
• 2016

In this paper, we obtain some behaviours of theta sums of higher index for the $Schr{\ddot{o}}dinger$-Weil representation of the Jacobi group associated with a positive definite symmetric real matrix of degree m.