In this paper, a new technique is offered for solving three types of linear integral equations of the 2nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those methods is produced. Finally, for more explanation, an algorithm is proposed and applied for testing examples to illustrate the effectiveness of the new technique.
This paper discusses estimating the two scale parameters of Exponential-Rayleigh distribution for singly type one censored data which is one of the most important Rights censored data, using the maximum likelihood estimation method (MLEM) which is one of the most popular and widely used classic methods, based on an iterative procedure such as the Newton-Raphson to find estimated values for these two scale parameters by using real data for COVID-19 was taken from the Iraqi Ministry of Health and Environment, AL-Karkh General Hospital. The duration of the study was in the interval 4/5/2020 until 31/8/2020 equivalent to 120 days, where the number of patients who entered the (study) hospital with sample size is (n=785). The number o
... Show MorePhysics and applied mathematics form the basis for understanding natural phenomena using differential equations depicting the flow in porous media, the motion of viscous liquids, and the propagation of waves. These equations provide a thorough study of physical processes, enhancing the understanding of complex applications in engineering, technology, and medicine. This paper presents novel approximate solutions for the Darcy-Brinkmann-Forchheimer moment equation, the Blasius equation and the FalknerSkan equation with initial / boundary conditions by using two iterative methods: the variational iteration method and the optimal variational iteration method. The variational iteration method is effectively developed by adding a control paramete
... Show MoreThe Aim of this paper is to investigate numerically the simulation of ice melting in one and two dimension using the cell-centered finite volume method. The mathematical model is based on the heat conduction equation associated with a fixed grid, latent heat source approach. The fully implicit time scheme is selected to represent the time discretization. The ice conductivity is chosen
to be the value of the approximated conductivity at the interface between adjacent ice and water control volumes. The predicted temperature distribution, percentage melt fraction, interface location and its velocity is compared with those obtained from the exact analytical solution. A good agreement is obtained when comparing the numerical results of one
In this paper, the proposed phase fitted and amplification fitted of the Runge-Kutta-Fehlberg method were derived on the basis of existing method of 4(5) order to solve ordinary differential equations with oscillatory solutions. The recent method has null phase-lag and zero dissipation properties. The phase-lag or dispersion error is the angle between the real solution and the approximate solution. While the dissipation is the distance of the numerical solution from the basic periodic solution. Many of problems are tested over a long interval, and the numerical results have shown that the present method is more precise than the 4(5) Runge-Kutta-Fehlberg method.
In this paper, our aim is to study variational formulation and solutions of 2-dimensional integrodifferential equations of fractional order. We will give a summery of representation to the variational formulation of linear nonhomogenous 2-dimensional Volterra integro-differential equations of the second kind with fractional order. An example will be discussed and solved by using the MathCAD software package when it is needed.
An easy, eclectic, precise high-Performance Liquid Chromatographic (HPLC) procedure was evolved and validated to estimate of Piroxicam and Codeine phosphate. Chromatographic demarcation was accomplished on a C18 column [Use BDS Hypersil C18, 5μ, 150 x 4.6 mm] using a mobile phase of methanol: phosphate buffer (60:40, v/v, pH=2.3), the flow rate was 1.1 mL/min, UV detection was at 214 nm. System Suitability tests (SSTs) are typically performed to assess the suitability and effectiveness of the entire chromatography system. The retention time for Piroxicam was found to be 3.95 minutes and 1.46 minutes for Codeine phosphate. The evolved method has been validated through precision, limit of quantitation, specificity,
... Show MoreThe current research aims to provide a philosophical and knowledge framework to explain the issue of organizations dealing with Paradox phenomena by focusing on five main aspects. The first deals with the concept of paradox, and the second aspect deals with the types of forces paradox. While the third aspect regards subject of the philosophy of paradox in organization theory and the fourth side deals with methods of solving the paradox. Finally, the last side is exposed to the subject of the paradoxes of the three provided by the study (L
... Show MoreFinding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith
... Show More