• Bulletin of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.1033-1048
• /
• 2020

We synthesize the recent work done on conditionally defined Lucas and Fibonacci numbers, tying together various definitions and results generalizing the linear recurrence relation. Allowing for any initial conditions, we determine the generating function and a Binet-like formula for the general sequence, in both the positive and negative directions, as well as relations among various sequence pairs. We also determine conditions for periodicity of these sequences and graph some recurrent figures in Python.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.689-706
• /
• 2008

In this paper, a fifth order numerical method is presented for solving singularly perturbed two point boundary value problems with a boundary layer at one end point. The two point boundary value problem is transformed into general first order ordinary differential equation system. A discrete approximation of a fifth order compact difference scheme is presented for the first order system. An asymptotically equivalent first order equation of the original singularly perturbed two point boundary value problem is obtained from the theory of singular perturbations. It is used in the fifth order compact difference scheme to get a two term recurrence relation and is solved. Several linear and non-linear singular perturbation problems have been solved and the numerical results are presented to support the theory. It is observed that the present method approximates the exact solution very well.

• Journal of Advanced Research in Ocean Engineering
• /
• v.1 no.3
• /
• pp.157-167
• /
• 2015

In order to provide simple and accurate wave theory in design of offshore structure, an analytical approximation is introduced in this paper. The solution is limited to flat bottom having a constant water depth. Water is considered as inviscid, incompressible and irrotational. The solution satisfies the continuity equation, bottom boundary condition and non-linear kinematic free surface boundary condition exactly. Error for dynamic condition is quite small. The solution is suitable in description of breaking waves. The solution is presented with closed form and dispersion relation is also presented with closed form. In the last century, there have been two main approaches to the nonlinear problems. One of these is perturbation method. Stokes wave and Cnoidal wave are based on the method. The other is numerical method. Dean's stream function theory is based on the method. In this paper, power series method was considered. The power series method can be applied to certain nonlinear differential equations (initial value problems). The series coefficients are specified by a nonlinear recurrence inherited from the differential equation. Because the non-linear wave problem is a boundary value problem, the power series method cannot be applied to the problem in general. But finite number of coefficients is necessary to describe the wave profile, truncated power series is enough. Therefore the power series method can be applied to the problem. In this case, the series coefficients are specified by a set of equations instead of recurrence. By using the set of equations, the nonlinear wave problem has been solved in this paper.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.39-53
• /
• 2014

In this paper, a non-asymptotic method is presented for solving singularly perturbed delay differential equations whose solution exhibits a boundary layer behavior. The second order singularly perturbed delay differential equation is replaced by an asymptotically equivalent first order neutral type delay differential equation. Then, Simpson's integration formula and linear interpolation are employed to get three term recurrence relation which is solved easily by Discrete Invariant Imbedding Algorithm. Some numerical examples are given to validate the computational efficiency of the proposed numerical scheme for various values of the delay and perturbation parameters.

• Journal of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1207-1220
• /
• 2018

The generalized hyperharmonic numbers $h^{(m)}_n(k)$ are defined by means of the multiple harmonic numbers. We show that the hyperharmonic numbers $h^{(m)}_n(k)$ satisfy certain recurrence relation which allow us to write them in terms of classical harmonic numbers. Moreover, we prove that the Euler-type sums with hyperharmonic numbers: $$S(k,m;p):=\sum\limits_{n=1}^{{\infty}}\frac{h^{(m)}_n(k)}{n^p}(p{\geq}m+1,\;k=1,2,3)$$ can be expressed as a rational linear combination of products of Riemann zeta values and harmonic numbers. This is an extension of the results of Dil [10] and $Mez{\ddot{o}}$ [19]. Some interesting new consequences and illustrative examples are considered.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.411-423
• /
• 2010

In this paper, a numerical method for singular perturbation problems arising in chemical reactor theory for general singularly perturbed two point boundary value problems with boundary layer at one end(left or right) of the underlying interval is presented. The original second order differential equation is replaced by an approximate first order differential equation with a small deviating argument. By using the trapezoidal formula we obtain a three term recurrence relation, which is solved using Thomas Algorithm. To demonstrate the applicability of the method, we have solved four linear (two left and two right end boundary layer) and one nonlinear problems. From the results, it is observed that the present method approximates the exact or the asymptotic expansion solution very well.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1273-1287
• /
• 2008

In this paper, the numerical integration method for general singularly perturbed two point boundary value problems with mixed boundary conditions of both left and right end boundary layer is presented. The original second order differential equation is replaced by an approximate first order differential equation with a small deviating argument. By using the trapezoidal formula we obtain a three term recurrence relation, which is solved using Thomas Algorithm. To demonstrate the applicability of the method, we have solved four linear (two left and two right end boundary layer) and one nonlinear problems. From the results, it is observed that the present method approximates the exact or the asymptotic expansion solution very well.

• Journal of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.1019-1030
• /
• 2020

Efficient computation of r-th root in 𝔽_q has many applications in computational number theory and many other related areas. We present a new r-th root formula which generalizes Müller's result on square root, and which provides a possible improvement of the Cipolla-Lehmer type algorithms for general case. More precisely, for given r-th power c ∈ 𝔽_q, we show that there exists α ∈ 𝔽_q^r such that $$Tr{\left(\begin{array}{cccc}{{\alpha}^{{\frac{({\sum}_{i=0}^{r-1}\;q^i)-r}{r^2}}}\atop{\text{ }}}\end{array}\right)}^r=c,$$ where $Tr({\alpha})={\alpha}+{\alpha}^q+{\alpha}^{q^2}+{\cdots}+{\alpha}^{q^{r-1}}$ and α is a root of certain irreducible polynomial of degree r over 𝔽_q.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.499-503
• /
• 2016

We study algorithms that can efficiently find cube roots by modifying Cipolla-Lehmer algorithm. In this paper, we present two type algorithms for finding cube roots in finite field, which improves Cipolla-Lehmer algorithm. If the number of multiplications of two type algorithms has a little bit of a difference, then it is more efficient algorithm which have less storage variables.

• Communications of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.341-354
• /
• 2023

In this article, an alternating Fibonacci sequence is defined from a second-order linear homogeneous recurrence relation with constant coefficients. Then, the determinant, inverse, and eigenvalues of the circulant matrices with entries in the first row having the formation of the sequence are formulated explicitly in a simple way. In this study, the method for deriving the formulation of the determinant and inverse is simply using traditional elementary row or column operations. For the eigenvalues, the known formulation from the case of general circulant matrices is simplified by considering the specialty of the sequence and using cyclic group properties. We also propose algorithms for the formulation to show how efficient the computations are.