In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H
... Show MoreThis work includes the synthesis of new ester compounds containing two 1,3,4-oxadiazole rings, 15a-c and 16a-c. This was done over seven steps, starting with p-acetamido-phenol 1 and 2-mercaptobenzoimidazole 2. The structure of the products was determined using FT-IR, 1H NMR, and mass spectroscopy. The evaluation of the antimicrobial activities of some prepared compounds was achieved against four types of bacteria (two types of gram-positive bacteria; Staphylococcus aureus and Bacillus subtilis, and two types of gram-negative bacteria, Pseudomonas aeruginosa and E. Coli), as well as against one types of fungus (C. albino). The results show moderate activit against the study bacteria, and the theoretical analysis of the toxi
... Show MoreN-Benzylidene m-nitrobenzeneamines (Schiff bases) were prepared by condensation of m-nitroaniline with aromatic aldehydes. These Schiff bases were found to react with maleic anhydride to give 2-Aryl-3-(m-nitrophenyl)-2, 3-dihydro [1, 3] oxazepine–4, 7–diones and with phthalic anhydride to give 2-Aryl-3–(m-nitrophenyl)–2, 3–dihydrobenz|| 1, 2-e|||| 1, 3] oxazepine–4, 7-diones which were reacted with pyrrolidine to give the anilide–pyrrolidides of maleic acid and phthalic acid.
This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc
... Show MoreThis book includes three main chapters: 1. Functions & Their Derivatives. 2. Minimum, Maximum and Inflection points. 3. Partial Derivative. In addition to many examples and exercises for the purpose of acquiring the student's ability to think correctly in solving mathematical questions.
The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.
Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,
... Show More