Recurrence relations for the Fourier expansion of the Jacobian elliptic functions snm(u, k), cnm(u, k), dnm(u, k) with m⩾1 and those for the expansion of sinm(πx), cosm(πx) in powers of the Jacobian elliptic functions with m⩾1 are studied and their parallel evaluation is formulated using nested recurrent product form algorithm.Recurrence relations for the Fourier expansion of the Jacobian elliptic functions snm(u, k), cnm(u, k), dnm(u, k) with m⩾1 and those for the expansion of sinm(πx), cosm(πx) in powers of the Jacobian elliptic functions with m⩾1 are studied and their parallel evaluation is formulated using nested recurrent product form algorith
AbstractIn this paper, the author develops a general formula for numbers which are extensions of the...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
This thesis presents some new identities between Ramanujan's arithmetical function r(n) and the divi...
AbstractRecurrence relations for the Fourier expansion of the Jacobian elliptic functions snm(u, k),...
AbstractWe construct fast algorithms for evaluating transforms associated with families of functions...
4 pages, no figures.-- MSC2000 codes: 33C15, 33F05, 40A15.-- Running title: "Recurrences and continu...
In this paper we derive some recurrence formulae which can be used to calculate the Fourier expansio...
AbstractVarious properties of Jacobian elliptic functions can be put in a form that remains valid un...
The aim of this paper is to obtain some new recurrence relations for the “modified” Jacobi functions...
AbstractAn algorithmic approach is given to construct recurrence relations for the coefficients of t...
We solve the general case of the finite-summation-of-integer-powers problem Sp(N) = PN k=1 kp for ar...
In the paper, the author presents diagonal recurrence relations for the Stirling numbers of the firs...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
We use the Z-transform to solve a type of recurrence relation satisfied by the number of representat...
AbstractExtensions and improvements of a recent paper, “On Digit Expansions with Respect to Linear R...
AbstractIn this paper, the author develops a general formula for numbers which are extensions of the...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
This thesis presents some new identities between Ramanujan's arithmetical function r(n) and the divi...
AbstractRecurrence relations for the Fourier expansion of the Jacobian elliptic functions snm(u, k),...
AbstractWe construct fast algorithms for evaluating transforms associated with families of functions...
4 pages, no figures.-- MSC2000 codes: 33C15, 33F05, 40A15.-- Running title: "Recurrences and continu...
In this paper we derive some recurrence formulae which can be used to calculate the Fourier expansio...
AbstractVarious properties of Jacobian elliptic functions can be put in a form that remains valid un...
The aim of this paper is to obtain some new recurrence relations for the “modified” Jacobi functions...
AbstractAn algorithmic approach is given to construct recurrence relations for the coefficients of t...
We solve the general case of the finite-summation-of-integer-powers problem Sp(N) = PN k=1 kp for ar...
In the paper, the author presents diagonal recurrence relations for the Stirling numbers of the firs...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
We use the Z-transform to solve a type of recurrence relation satisfied by the number of representat...
AbstractExtensions and improvements of a recent paper, “On Digit Expansions with Respect to Linear R...
AbstractIn this paper, the author develops a general formula for numbers which are extensions of the...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
This thesis presents some new identities between Ramanujan's arithmetical function r(n) and the divi...