ABSTRICT:

  This study is concerned with the estimation of constant  and time-varying parameters in non-linear ordinary differential equations, which do not have analytical solutions. The estimation is done in a multi-stage method where constant and time-varying parameters are estimated in a straight sequential way from several stages. In the first stage, the model of the differential equations is converted to a regression model that includes the state variables with their derivatives and then the estimation of the state variables and their derivatives in a penalized splines method and compensating the estimations in the regression model. In the second stage, the pseudo- least squares method was used to es

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

This research is concerned with the study of (the aesthetic of constructive relations in linear composition) with what distinguished Arabic calligraphy through the style and artistic method in its construction, and the specifications it carries that enabled it to pay attention to building formations to achieve in its total linear ranges aesthetic values and relationships. Through the research, the models and the exploratory study that he obtained, the researcher was able to raise the research problem in the first chapter according to the following question: What is the aesthetic of constructive relations in linear formation?
The importance of the research in achieving the aesthetics of the formations, which is a wide field according t

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

Q fever is an infectious disease of animals and humans, caused by globally distributed C. burnetii. In Iraq, there are no previous studies associated with the detection of the organism in cattle. An overall of 130 lactating cows were submitted to direct collection of milk samples. Initially, the samples of milk were tested using the molecular polymerase chain reaction (PCR) assay targeting three genes (16S rRNA, IS1111a transposase, and htpB). However, positive results (18.46%; 24/130) were detected only with the 16s rRNA gene. Concerning risk factors, the highest prevalence of C. burnetii was showed in the district of Badra (42.86%), whereas the lowest - in Al-Numaniyah and Al-Suwaira districts (P=0.025). There was no significant v

The aim of this paper is to present a method for solving third order ordinary differential equations with two point boundary condition , we propose two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by compared with conventional 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