Journal of Progressive Research in Mathematics http://scitecresearch.com/journals/index.php/jprm Journal of Progressive Research in Mathematics en-US jprmeditor@scitecresearch.com (Managing Editor) jprmeditor@scitecresearch.com (JPRM Support Team) Thu, 12 Jan 2023 14:20:16 +0000 OJS 3.1.1.2 http://blogs.law.harvard.edu/tech/rss 60 On the computation of zeros of Bessel functions http://scitecresearch.com/journals/index.php/jprm/article/view/2171 <p>The zeros of some chosen Bessel functions of different orders is revised using the well-known bisection method , McMahon formula is also reviewed and the calculation of some zeros are carried out implementing a recent version of MATLAB software.</p> <p>The obtained results are analyzed and discussed on the lights of previous calculations.</p> Tahani E. Ahmed, Muna S. Akrim, Khadiga S. Abdeen, Ali M. Awin ##submission.copyrightStatement## http://creativecommons.org/licenses/by-nc/4.0 http://scitecresearch.com/journals/index.php/jprm/article/view/2171 Thu, 12 Jan 2023 14:19:24 +0000 Generalized Pierre Numbers http://scitecresearch.com/journals/index.php/jprm/article/view/2182 <p>In this paper, we introduce and investigate the generalized Pierre sequences for the first time and we deal with, in detail, two special cases, namely, Pierre and Pierre-Lucas sequences. We present Binet's formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences. Furthermore, we show that there are close relations between Pierre, Pierre-Lucas and Tribonacci, Tribonacci-Lucas numbers.</p> YĆ¼ksel Soykan ##submission.copyrightStatement## http://creativecommons.org/licenses/by-nc/4.0 http://scitecresearch.com/journals/index.php/jprm/article/view/2182 Sun, 19 Feb 2023 07:40:34 +0000 Numerical Methods for Convex Quadratic Programming with Nonnegative Constraints http://scitecresearch.com/journals/index.php/jprm/article/view/2194 <p>This paper deals with some problems in numerical simulation for convex quadratic programming with nonnegative constraints. For systems of ordinary differential equations which derived from the above mentioned problem, we construct a kind of new numerical method: the modified implicit Euler method. Under some restrictions for step-size, we obtained the numerical solution which satisfied with the termination condition. Compared with the classical Matlab command ODE23, the new method has ideal computation cost.</p> Qi Wang ##submission.copyrightStatement## http://creativecommons.org/licenses/by-nc/4.0 http://scitecresearch.com/journals/index.php/jprm/article/view/2194 Sun, 05 Mar 2023 12:19:43 +0000