• Nuclear Engineering and Technology
• /
• v.31 no.2
• /
• pp.172-181
• /
• 1999

Series expansion methods to compute the exponential of a matrix have been compared by applying them to fuel depletion calculations. Specifically, Taylor, Pade, Chebyshev, and rational Chebyshev approximations have been investigated by approximating the exponentials of bum matrices by truncated series of each method with the scaling and squaring algorithm. The accuracy and efficiency of these methods have been tested by performing various numerical tests using one thermal reactor and two fast reactor depletion problems. The results indicate that all the four series methods are accurate enough to be used for fuel depletion calculations although the rational Chebyshev approximation is relatively less accurate. They also show that the rational approximations are more efficient than the polynomial approximations. Considering the computational accuracy and efficiency, the Pade approximation appears to be better than the other methods. Its accuracy is better than the rational Chebyshev approximation, while being comparable to the polynomial approximations. On the other hand, its efficiency is better than the polynomial approximations and is similar to the rational Chebyshev approximation. In particular, for fast reactor depletion calculations, it is faster than the polynomial approximations by a factor of ∼ 1.7.

• Structural Engineering and Mechanics
• /
• v.5 no.3
• /
• pp.283-295
• /
• 1997

This paper presents a high precision integration method for the dynamic response analysis of structures with holonomic constraints. A detail recursive scheme suitable for algebraic and differential equations (ADEs) which incorporates generalized forces is established. The matrix exponential involved in the scheme is calculated precisely using $2^N$ algorithm. The Taylor expansions of the nonlinear term concerned with state variables of the structure and the generalized constraint forces of the ADEs are derived and consequently, their particular integrals are obtained. The accuracy and effectiveness of the present method is demonstrated by two numerical examples, a plane truss with circular slot at its tip point and a slewing flexible cantilever beam which is currently interesting in optimal control of robot manipulators.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.1
• /
• pp.265-274
• /
• 2016

In this paper, we consider a diffusion risk process, in which, its surplus process behaves like a Brownian motion in-between adjacent epochs of claims. We assume that the claims occur following a Poisson process and their sizes are independent and exponentially distributed with the same intensity. Our main goal is to derive the exact formula of the joint moment generating function of the ruin time and the total amount of aggregated claim sizes until ruin in the diffusion risk process. We also provide a method for computing the related first and second moments using the joint moment generating function and the augmented matrix exponential function.

• Journal of Multimedia Information System
• /
• v.8 no.1
• /
• pp.45-56
• /
• 2021

This document traces the new technologies development based on a deep classical Hill method improvement. Based on the chaos, this improvement begins with the 256 element body construction, which is to replace the classic ring used by all encryption systems. In order to facilitate the application of algebraic operators on the pixels, two substitution tables will be created, the first represents the discrete logarithm, while the second represents the discrete exponential. At the same time, a large invertible matrix whose structure will be explained in detail will be the subject of the advanced classical Hill technique improvement. To eliminate any linearity, this matrix will be accompanied by dynamic vectors to install an affine transformation. The simulation of a large number of images of different sizes and formats checked by our algorithm ensures the robustness of our method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.1
• /
• pp.49-66
• /
• 2022

The G-Euler process has been proposed to overcome the difficulties of the calculation of the exponential function of the Jacobian. It is an explicit method that uses the exponential function of the scalar skew-symmetric matrix. We define the moving shapes of true solutions and the moving shapes of numerical solutions. It is discussed whether the moving shape of the numerical solution matches the moving shape of the true solution. The match rates of these two kinds of moving shapes are sequentially calculated by the G-Euler process without using the true solution. It is shown that the closer the minimum match rate is to 100%, the more closely the numerical solutions follow the true solutions to the end. The minimum match rate indicates the reliability of the numerical solution calculated by the G-Euler process. The graphs of the Lorenz system in Perko [1] are different from those drawn by the G-Euler process. By the way, there is no basis for claiming that the Perko's graphs are reliable.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1327-1335
• /
• 2011

This paper demonstrates that there is a unique exponentially stable equilibrium state of a class of impulsive cellular neural network with delays. The analysis exploits M-matrix theory and generalized comparison principle to derive some easily verifiable sufficient conditions for the global exponential stability of the equilibrium state. The results extend and improve earlier publications. An example with its simulation is given for illustration of theoretical results.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.427-438
• /
• 2005

From a notion of d-pseudo-orthogonality for a sequence of poly-nomials ($d\;\in\;{2,3,\cdots}$), this paper introduces three different characterizations of natural exponential families (NEF's) with polynomial variance functions of exact degree 2d-1. These results provide extended versions of the Meixner (1934), Shanbhag (1972, 1979) and Feinsilver (1986) characterization results of quadratic NEF's based on classical orthogonal polynomials. Some news sets of polynomials with (2d-1)-term recurrence relation are then pointed out and we completely illustrate the cases associated to the families of positive stable distributions.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2005.05a
• /
• pp.157-158
• /
• 2005

• Structural Engineering and Mechanics
• /
• v.43 no.1
• /
• pp.1-13
• /
• 2012

A fast precise integration method (FPIM) is proposed for solving structural dynamics problems. It is based on the original precise integration method (PIM) that utilizes the sparse nature of the system matrices and especially the physical features found in structural dynamics problems. A physical interpretation of the matrix exponential is given, which leads to an efficient algorithm for both its evaluation and subsequently the solution of large-scale structural dynamics problems. The proposed algorithm is accurate, efficient and requires less computer storage than previous techniques.

• Honam Mathematical Journal
• /
• v.42 no.2
• /
• pp.269-291
• /
• 2020

In this paper, we get acquainted to a new generalization of the modified Hermite matrix polynomials. An explicit representation and expansion of the Matrix exponential in a series of these matrix polynomials is obtained. Some important properties of Modified Hermite Matrix polynomials such as generating functions, recurrence relations which allow us a mathematical operations. Also we drive expansion formulae and some operational representations.