• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.473-506
• /
• 2016

This paper continues the study of recursion formulas of multivariable hypergeometric functions. Earlier, in [4], the authors have given the recursion formulas for three variable Lauricella functions, Srivastava's triple hypergeometric functions and k-variable Lauricella functions. Further, in [5], we have obtained recursion formulas for the general triple hypergeometric function. We present here the recursion formulas for Exton's triple hypergeometric functions.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.377-381
• /
• 2005

We present a convenient recursive formula for the sums of alternating harmonic series of odd order. The recursion is obtained by expanding in Fourier series certain elementary functions.

• East Asian mathematical journal
• /
• v.39 no.3
• /
• pp.331-347
• /
• 2023

We present an identity on moments of a compound random variable by using an auxiliary counting random variable. Based on this identity, we develop a new recurrence formula for obtaining the raw and central moments of any order for a given compound random variable.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.832-844
• /
• 2020

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.8
• /
• pp.826-832
• /
• 2007

Fully flexible cell preserves Hamiltonian in structure so that the symplectic time integrator is applicable to the equations of motion. In the direct formulation of fully flexible cell N-Sigma-T ensemble, a generalized leapfrog time integration (GLF) is applicable for fully flexible cell simulation, but the equations of motion by GLF has structure of implicit algorithm. In this paper, the time integration formula is derived for the fully flexible cell molecular dynamics simulation by using the splitting time integration. It separates flexible cell Hamiltonian into terms corresponding to each of Hamiltonian term. Thus the simple and completely explicit recursion formula was obtained. We compare the performance and the result of present splitting time integration with those of the implicit generalized leapfrog time integration.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.389-394
• /
• 2006

Fully flexible cell preserves Hamiltonian in structure, so the symplectic time integrator is applied to the equations of motion. Primarily, generalized leapfrog time integration (GLF) is applicable, but the equations of motion by GLF have some of implicit formulas. The implicit formulas give rise to a complicate calculation for coding and need an iteration process. In this paper, the time integration formulas are obtained for the fully flexible cell molecular dynamics simulation by using the splitting time integration. It separates flexible cell Hamiltonian into terms corresponding to each of Hamiltonian term, so the simple and completely explicit recursion formula was obtained. The explicit formulas are easy to implementation for coding and may be reduced the integration time because they are not need iteration process. We are going to compare the resulting splitting time integration with the implicit generalized leapfrog time integration.

• Korean Journal of Mathematics
• /
• v.16 no.4
• /
• pp.481-494
• /
• 2008

Iteration functions $K_m(z)$ and $U_m(z)$, $m{\geq}2$are defined recursively using the determinant of a matrix. We show that the fixed-iterations of $K_m(z)$ and $U_m(z)$ converge to a simple zero with order of convergence m and give closed form expansions of $K_m(z)$ and $U_m(z)$: To show the convergence, we derive a recursion formula for $L_m$ and then apply the idea of Ford or Pomentale. We also find a Toeplitz matrix whose determinant is $L_m(z)/(f^{\prime})^m$, and then we adapt the well-known results of Gerlach and Kalantari et.al. to give closed form expansions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.12
• /
• pp.1343-1352
• /
• 1992

This paper presents a new and easy method to obtain the Fourier transforms of the n-th order cosine-pulses whose maximum amplitudes are uniform. The new method is focused on deriving a formula which is recursively related following their orders and can be well applied to some numerical solutions. On the other hand, this method also offers more compact procedures in view of analytical solutions than the conventional methods because the results are consist of the sum of two functions which are easily calculated. Especially, the formula can be represented as a complete recursion by the separation of coefficients originated by the authors and the resulting difference equation is given by the sum of the original 'sinc' functions shifted by some symmetrical factors and multiplied by some constants. The constants are easily decided from the binomial coefficients and the shifting factors from the corresponding exponential differences in the expansion of $(a+b)^n$.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.3
• /
• pp.16-24
• /
• 1994

A single channel adaptive noise canceling (ANC) technique is presented for removing effects of additive noise on the speech signal. The conventional method obtains a reference signal using the pitch estimated on a frame basis from the input speech. The proposed method, however, gets the reference signal using the delay estimated recursively on a sample by sample basis. To estimate the delay, we derive recursion formula of autocorrelation function and average magnitude difference function. The performance of the proposed method is evaluated for the speech signals distorted by the additive white Gaussian noise. Experimental results with normalized least mean square (NLMS) adaptive algorithm demonstrate that the proposed method improves the perceived speech quality quite well besides the signal-to-noise ratio.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3
• /
• pp.94-98
• /
• 1997

The most commonly used method to generate sonar transmitting beam is extracting digital samples out of memory, which are to excite transducers of the phased array respectively. As several types of signals have been used in sonar to enhance the performance of sonar in various environments, a large amount of memory is required to store them. In this paper, we adopt recursive algorithm to synthesize every different time-delayed signal for transmitting beams with small amount of memory and simple arithmetic operations. The error due to recursive calculation is also analyzed.