• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.8
• /
• pp.800-807
• /
• 2012

In this paper, radiation efficiency of the plate surround by an infinite rigid baffle is studied. The plate is simply supported and one side is in contact with air, while other side with water. The pressure and normal velocity over the plate surface are assumed as modal summations, from which a set of linear equations is obtained for fluid-structure coupled problem. It is shown that neglect of the cross modes results in overestimation of the radiation efficiency specifically for mid-frequency ranges. Based on the fact that the responses are mainly determined from the first few cross modes in addition to the diagonal terms, a new algorithm is proposed, where banded matrix is iteratively solved in computing radiation efficiency. In numerical examples, it is found that radiation efficiency obtained from banded matrix is in excellent agreement with the one from the full matrix, while computing time is significantly reduced. It is also found that as frequency grows larger, radiation efficiency considering only diagonal terms is a good approximation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.575-580
• /
• 1992

Mixed H$_{2}$/H$_{\infty}$ robust control synthesis is considered for finite dimensional linear time-invariant systems under the presence of diagonal structured uncertainties. Such uncertainties arise for instance when there is real perturbation in the nominal model of the state space system or when modeling multiple (unstructured) uncertainty at different locations in the feedback loop. This synthesis problem is reduced to convex optimization problem over a bounded subset of matrices as well as diagonal matrix having certain structure. For computational purpose, this convex optimization problem is further reduced into Generalized Eigenvalue Minimization Problem where a powerful algorithm based on interior point method has been recently developed..

• East Asian mathematical journal
• /
• v.39 no.5
• /
• pp.523-528
• /
• 2023

Let S_n = [S(i, j)]_1≤i,j≤n and S^*_n = [S(i + j, j)]_1≤i,j≤n where S(i, j) is the Stirling number of the second kind. Choi and Jo [On the determinants of the square-type Stirling matrix and Bell matrix, Int. J. Math. Math. Sci. 2021] obtained the diagonal entries of matrix U in the LU-factorization of S^*_n for calculating the determinant of S^*_n, where L = S_n. In this paper, we compute the all entries of U in the LU-factorization of matrix S^*_n. This implies the identities related to Stirling numbers of both kinds.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.15-20
• /
• 2016

Compared to the MIMO system using the spatial multiplexing methods and the MIMO system using the diversity scheme achieved a high rate, but the lower the diversity gain to improve the data transmission reliability should separate the spatial stream at the MIMO receiver. In this paper, we compared Channel capacity detection methods with the Lattice code, the 3-user interference channel and linear channel interference detection methods ZF (Zero Forcing) and MMSE (Minimum Mean Square Error) detection methods. The channel is a Diagonal channel. In other words, Diagonal channel is confirmed by the inverse matrix satisfies the properties of Jacket are element-wise inverse to $[H]_N[H]_N^{-1}=[I]_N$.

• Journal of Sensor Science and Technology
• /
• v.29 no.6
• /
• pp.440-446
• /
• 2020

A well-known difficulty in attitude estimation based on inertial measurement unit (IMU) signals is the occurrence of external acceleration under dynamic motion conditions, as the acceleration significantly degrades the estimation accuracy. Lee et al. (2012) designed a Kalman filter (KF) that could effectively deal with the acceleration issue. Ahmed and Tahir (2017) modified this method by adjusting the acceleration-related covariance matrix because they considered covariance modeling as a pivotal factor in the estimation accuracy. This study investigates the effects of covariance modeling on estimation accuracy in an IMU-based attitude estimation KF. The method proposed by Ahmed and Tahir can be divided into two: one uses the covariance including only diagonal components and the other uses the covariance including both diagonal and off-diagonal components. This paper compares these three methods with respect to the motion condition and the window size, which is required for the methods by Ahmed and Tahir. Experimental results showed that the method proposed by Lee et al. performed the best among the three methods under relatively slow motion conditions, whereas the modified method using the diagonal covariance with a high window size performed the best under relatively fast motion conditions.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1017-1031
• /
• 2016

Let R be a commutative ring with the non-zero identity and n be a natural number. ${\Gamma}^n_R$ is a simple graph with $R^n{\setminus}\{0\}$ as the vertex set and two distinct vertices X and Y in $R^n$ are adjacent if and only if there exists an $n{\times}n$ lower triangular matrix A over R whose entries on the main diagonal are non-zero such that $AX^t=Y^t$ or $AY^t=X^t$, where, for a matrix B, $B^t$ is the matrix transpose of B. ${\Gamma}^n_R$ is a generalization of Cayley graph. Let $T_n(R)$ denote the $n{\times}n$ upper triangular matrix ring over R. In this paper, for an arbitrary ring R, we investigate the properties of the graph ${\Gamma}^n_{T_n(R)}$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.739-748
• /
• 1992

A CGM iterative systolic algorithm to solve large sparse linear systems of equations is presented. For implementation of the algorithm, a systolic array using the stripe structure is proposed. The matrix A is decomposed into a strictly lower triangular matrix, a diagonal matrix, and a strictly up-per triangular matrix, and the two formers and the tatter· are concurrently computed by different linear arrays. Hence, the execution time of this approach Is reduced to half of the execution time of the that a linear array is used. computation of the Irregularly distributed sparse matrix can be executed effectively by using the stripe structure.

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

This paper presents a stiffness analysis method for a low-DOF parallel manipulator, which takes into account of elastic deformations of joints and links. A low-DOF parallel manipulator is defined as a spatial parallel manipulator which has less than six degrees of freedom. Differently from the case of a 6-DOF parallel manipulator, the serial chains in a low-DOF parallel manipulator are subject to constraint forces as well as actuation forces. The reaction forces due to actuations and constraints in each limb can be determined by making use of the theory of reciprocal screws. It is shown that the stiffness model of an F-DOF parallel manipulator consists of F springs related to the reciprocal screws of actuations and 6-F springs related to the reciprocal screws of constraints, which connect the moving platform to the fixed base in parallel. The $6{times}6$ stiffness matrix is derived, which is the sum of the stiffness matrices of actuations and constraints. The six spring constants can be precisely determined by modeling the compliance of joints and links in a serial chain as follows; the link can be considered as an Euler beam and the stiffness matrix of rotational or prismatic joint can be modeled as a $6{times}6$ diagonal matrix, where one diagonal element about the rotation axis or along the sliding direction is zero. By summing the elastic deformations in joints and links, the compliance matrix of a serial chain is obtained. Finally, applying the reciprocal screws to the compliance matrix of a serial chain, the compliance values of springs can be determined. As an example of explaining the procedure, the stiffness of the Tricept parallel manipulator has been analyzed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.4
• /
• pp.320-328
• /
• 2007

This paper presents a stiffness modeling of a low-DOF parallel robot, which takes into account of elastic deformations of joints and links, A low-DOF parallel robot is defined as a spatial parallel robot which has less than six degrees of freedom. Differently from serial chains in a full 6-DOF parallel robot, some of those in a low-DOF parallel robot may be subject to constraint forces as well as actuation forces. The reaction forces due to actuations and constraints in each serial chain can be determined by making use of the theory of reciprocal screws. It is shown that the stiffness of an F-DOF parallel robot can be modeled such that the moving platform is supported by 6 springs related to the reciprocal screws of actuations (F) and constraints (6-F). A general $6{\times}6$ stiffness matrix is derived, which is the sum of the stiffness matrices of actuations and constraints, The compliance of each spring can be precisely determined by modeling the compliance of joints and links in a serial chain as follows; a link is modeled as an Euler beam and the compliance matrix of rotational or prismatic joint is modeled as a $6{\times}6$ diagonal matrix, where one diagonal element about the rotation axis or along the sliding direction is infinite. By summing joint and link compliance matrices with respect to a reference frame and applying unit reciprocal screw to the resulting compliance matrix of a serial chain, the compliance of a spring is determined by the resulting infinitesimal displacement. In order to illustrate this methodology, the stiffness of a Tricept parallel robot has been analyzed. Finally, a numerical example of the optimal design to maximize stiffness in a specified box-shape workspace is presented.

• Honam Mathematical Journal
• /
• v.26 no.1
• /
• pp.3-15
• /
• 2004

In the fuzzy theory, a matrix A is idempotent if $A^2=A$. The idempotent fuzzy matrices are important in various applications and have many interesting properties. Using the upper diagonal completion process, we have the zero patterns of idempotent fuzzy matrix, that is, the idempotent Boolean matrices. In addition, we give the construction of all idempotent fuzzy matrices for each dimension n.