• East Asian mathematical journal
• /
• v.23 no.2
• /
• pp.135-149
• /
• 2007

In 1975, Wenger [4] determined the fine spectra of $Ces{\grave{a}}ro$ operator $C_1$ on c, the space of convergent sequences. In [7], the spectrum of the Rhaly operators on $c_0$ and c, under the assumption that ${lim}\limits_{n{\rightarrow}{\infty}}(n+1)a_n\;=\;L\;{\neq}\;0$, has been determined. In this paper the author determine the fine spectra of the Rhaly matrix $R_a$ as an operator on the space c, with the same assumption.

• Honam Mathematical Journal
• /
• v.29 no.3
• /
• pp.427-443
• /
• 2007

The spanning column rank of an $m{\times}n$ integer matrix A is the minimum number of the columns of A that span its column space. We compare the spanning column rank with column rank of matrices over the ring of integers. We also characterize the linear operators that preserve the spanning column rank of integer matrices.

• Communications of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.705-718
• /
• 2022

In this paper, for bounded linear operators A, B, C satisfying [AB, B] = [BC, B] = [AB, BC] = 0 we study the Drazin invertibility of the sum of products formed by the three operators A, B and C. In particular, we give an explicit representation of the anti-commutator {A, B} = AB + BA. Also we give some conditions for which the sum A + C is Drazin invertible.

• Journal of applied mathematics & informatics
• /
• v.41 no.1
• /
• pp.123-132
• /
• 2023

We define an operator version of the relative Rényi entropy as the generalization of relative von Neumann entropy, and provide its fundamental properties and the bounds for its trace value. Moreover, we see an effect of the relative Rényi entropy under tensor product, and show the sub-additivity for density matrices.

• Communications of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.91-103
• /
• 2022

In this paper, we introduce Toeplitz operators and Hankel operators with complex Borel measures on the closed unit disk. When a positive measure 𝜇 on (-1, 1) is a Carleson measure, it is known that the corresponding Hankel matrix is bounded and vice versa. We show that for a positive measure 𝜇 on 𝔻, 𝜇 is a Carleson measure if and only if the Toeplitz operator with symbol 𝜇 is a densely defined bounded linear operator. We also study Hankel operators of Hilbert-Schmidt class.

• The Mathematical Education
• /
• v.27 no.1
• /
• pp.29-35
• /
• 1988

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2331-2336
• /
• 2005

This paper proposes a new haptic device using a parallel mechanism with gimbal type actuators. This device has three legs actuated by 2-DOF gimbal mechanisms, which make the device simple and light by fixing all the actuators to the base. Three extra sensors are placed at passive joints to obtain a unique solution of the forward kinematics problem. The proposed haptic device is developed for an operator to use it on a desktop in due consideration of the size of an average Korean. The proposed haptic device has a small workspace for on operator to use it on a desktop and more sensitivity than a serial type haptic device. Therefore, the motors of the proposed haptic device are fixed at the base plate so that the proposed haptic device has a better dynamic bandwidth due to a low moving inertia. With this conceptual design, optimization of the design parameters is carried out. The objective function is defined by the fuzzy minimum of the global design indices, global force/moment isotropy index, global force/moment payload index, and workspace. Each global index is calculated by a SVD (singular value decomposition) of the force and moment parts of the jacobian matrix. Division of the jacobian matrix assures a consistency of the units in the matrix. Due to the nonlinearity of this objective function, Genetic algorithms are adopted for a global optimization.

• Structural Engineering and Mechanics
• /
• v.39 no.5
• /
• pp.669-682
• /
• 2011

A Chebyshev spectral method (CSM) for the dynamic analysis of non-uniform Timoshenko beams under various boundary conditions and concentrated masses at their ends is proposed. The matrix-based Chebyshev spectral approach was used to construct the spectral differentiation matrix of the governing differential operator and its boundary conditions. A matrix condensation approach is crucially presented to impose boundary conditions involving the homogeneous Cauchy conditions and boundary conditions containing eigenvalues. By taking advantage of the standard powerful algorithms for solving matrix eigenvalue and generalized eigenvalue problems that are embodied in the MATLAB commands, chebfun and eigs, the modal parameters of non-uniform Timoshenko beams under various boundary conditions can be obtained from the eigensolutions of the corresponding linear differential operators. Some numerical examples are presented to compare the results herein with those obtained elsewhere, and to illustrate the accuracy and effectiveness of this method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.700-705
• /
• 2012

This paper addresses an intelligent digital redesign (IDR) technique for observer-based output-feedback control systems, in order to efficiently convert a pre-designed Takagi-Sugeno fuzzy model-based analog controller into a sampled-data one in the sense of state matching. A delta operator is used to get an asymptotic relation between the analog and the sampled-data control systems. The IDR problem is viewed as a minimization problem of the norm distances between linear operator to be matched. The condition is represented as linear matrix inequalities, and the separation principle on the IDR is shown.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.