Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

    The aim of our work is to develop a new type of games which are related to (D, WD, LD) compactness of topological groups. We used an infinite game that corresponds to our work. Also, we used an alternating game in which the response of the second player depends on the choice of the first one. Many results of winning and losing strategies have been studied, consistent with the nature of the topological groups. As well as, we presented some topological groups, which fail to have winning strategies and we give some illustrated examples. Finally, the effect of functions on the aforementioned compactness strategies was studied.  

Nitrogen-comprising heterocyclic compounds and their derivatives have empirically been invaluable as therapeutic agents. Fundamentally, 4-chloro-6-nitro-2-amino-1,3-benzothiazole 1 was synthesized via bromination of 2-chloro-4-nitro aniline with ammonium thiocyanate. This new heterocyclic haloorganoamino-1,3-benzothiazole derivative, was a starting material, which condensed and tethered with three different aromatic aldehyde pendant arm in presence of ethanol and glacial acetic acid isolating an interesting sequence of tridentate Schiff bases 2-4. These compounds were used for complexation reactions in 1:1 (metal: ligand) stoichiometry to obtain heteroleptic Al(III), Ni (II) and K(I) benzothiazole chelat

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.