• The Pure and Applied Mathematics
• /
• v.21 no.3
• /
• pp.207-218
• /
• 2014

The principal object of this paper is to study a class of matrix polynomials associated with Humbert polynomials. These polynomials generalize the well known class of Gegenbauer, Legendre, Pincherl, Horadam, Horadam-Pethe and Kinney polynomials. We shall give some basic relations involving the Humbert matrix polynomials and then take up several generating functions, hypergeometric representations and expansions in series of matrix polynomials.

• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.717-734
• /
• 1996

For a scalar rational function, the spectral data consisting of zeros and poles with their respective multiplicities uniquely determines the function up to a nonzero multiplicative factor. But due to the richness of the spectral structure of a rational matrix function, reconstruction of a rational matrix function from a given spectral data is not that simple.

• Communications of the Korean Mathematical Society
• /
• v.10 no.4
• /
• pp.849-854
• /
• 1995

The interpolation of scattered data with radial basis functions is knwon for its good fitting. But if data get large, the coefficient matrix becomes almost singular. We introduce different knots and nodes to improve condition number of coefficient matrix. The singulaity of new coefficient matrix is investigated here.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.53 no.10
• /
• pp.539-545
• /
• 2004

In this paper, we consider the problem of capacitance matrix calculation for strip-line and other interconnects crossings. The problem is formulated in the spectral domain using the method of moments. Sinc-functions are employed as basis functions. Conventionally, such a formulation leads to a large, non-sparse system of linear equations in which the calculation of each of the coefficient requires the evaluation of a Fourier-Bessel integral. Such calculations are computationally very intensive. In the method proposed here, we provide simplified expressions for the coefficients in the moment method matrix. Using these simplified expressions, the coefficients can be calculated very efficiently. This leads to a fast evaluation of the capacitance matrix of the structure. Computer simulations are provided illustrating the validity of the method proposed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.9
• /
• pp.806-811
• /
• 2012

In this paper Hartley functions are used to approximate the solutions of continuous time linear dynamical system. The Hartley function and its integral operational matrix are first presented, an efficient algorithm to solve the Stein equation is proposed. The algorithm is based on the compound matrix and the inverse of sum of matrices. Using the structure of the Hartley's integral operational matrix, the full order Stein equation should be solved in terms of the solutions of pure algebraic matrix equations, which reduces the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.

• Structural Engineering and Mechanics
• /
• v.7 no.3
• /
• pp.259-276
• /
• 1999

An analytical solution for the shape functions of a beam segment supported on a generalized two-parameter elastic foundation is derived. The solution is general, and is not restricted to a particular range of magnitudes of the foundation parameters. The exact shape functions can be utilized to derive exact analytic expressions for the coefficients of the element stiffness matrix, work equivalent nodal forces for arbitrary transverse loads and coefficients of the consistent mass and geometrical stiffness matrices. As illustration, each distinct coefficient of the element stiffness matrix is compared with its conventional counterpart for a beam segment supported by no foundation at all for the entire range of foundation parameters.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1133-1143
• /
• 2009

In this work, we successfully extended dimensional differential transform method (DTM), by presenting and proving some new theorems, to solve the non-linear matrix differential Riccati equations(first and second kind of Riccati matrix differential equations). This technique provides a sequence of matrix functions which converges to the exact solution of the problem. Examples show that the method is effective.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.795-812
• /
• 2013

The merit function arises from the development of the solution methods for the complementarity problems defined over the cone of non negative real vectors and has been well extended to the complementarity problems defined over the symmetric cones. In this paper, we focus on the extension of the merit functions including the gap function, the regularized gap function, the implicit Lagrangian and others to the complementarity problems defined over the nonsymmetric matrix cone. These theoretical results of this paper suggest new solution methods based on unconstrained and/or simply constrained methods to solve the matrix cone complementarity problems (MCCP).

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.198-204
• /
• 2003

In this paper, we presented a new algebraic iterative algorithm for the optimal control of the nonlinear systems. The algorithm is based on two steps. The first step transforms nonlinear optimal control problem into a sequence of linear optimal control problem using the quasilinearization method. In the second step, TPBCP(two point boundary condition problem) is solved by algebraic equations instead of differential equations using the new integral operational matrix of BPF(block pulse functions). The proposed algorithm is simple and efficient in computation for the optimal control of nonlinear systems and is less error value than that by the conventional matrix. In computer simulation, the algorithm was verified through the optimal control design of synchronous machine connected to an infinite bus.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.1-11
• /
• 1994

In computer graphics since objects atre constructed by lines and curves, the high-speed curve generator is indispensible for computer aided design and simulatation. Since the functions of graphic generation can be represented as a series of matrix operations, in this paper, two kind of the high-speed Bezier curve generator that uses matrix equation and a recursive relation for Bezier polynomials are designed. And B-spline curve generator is designed using interdependence of B-spline blending functions. As the result of the comparison of designed curve generator and reference [5], [6] in the operation time and number of operators, the curve generator with 1-dimensional systolic array processor for matrix vector operation that uses matrix equation for Bezier curve is more effective.