This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.
<p>Daftardar Gejji and Hossein Jafari have proposed a new iterative method for solving many of the linear and nonlinear equations namely (DJM). This method proved already the effectiveness in solved many of the ordinary differential equations, partial differential equations and integral equations. The main aim from this paper is to propose the Daftardar-Jafari method (DJM) to solve the Duffing equations and to find the exact solution and numerical solutions. The proposed (DJM) is very effective and reliable, and the solution is obtained in the series form with easily computed components. The software used for the calculations in this study was MATHEMATICA<sup>®</sup> 9.0.</p>
The human kidney is one of the most important organs in the human body; it performs many functions
and has a great impact on the work of the rest of the organs. Among the most important possible treatments is
dialysis, which works as an external artificial kidney, and several studies have worked to enhance the
mechanism of dialysate flow and improve the permeability of its membrane. This study introduces a new
numerical model based on previous research discussing the variations in the concentrations of sodium,
potassium, and urea in the extracellular area in the blood during hemodialysis. We simulated the differential
equations related to mass transfer diffusion and we developed the model in MATLAB Simu
The study deals with the issue of multi-choice linear mathematical programming. The right side of the constraints will be multi-choice. However, the issue of multi-purpose mathematical programming can not be solved directly through linear or nonlinear techniques. The idea is to transform this matter into a normal linear problem and solve it In this research, a simple technique is introduced that enables us to deal with this issue as regular linear programming. The idea is to introduce a number of binary variables And its use to create a linear combination gives one parameter was used multiple. As well as the options of linear programming model to maximize profits to the General Company for Plastic Industries product irrigation sy
... Show MoreMany numerical approaches have been suggested to solve nonlinear problems. In this paper, we suggest a new two-step iterative method for solving nonlinear equations. This iterative method has cubic convergence. Several numerical examples to illustrate the efficiency of this method by Comparison with other similar methods is given.
The study of cohomology groups is one of the most intensive and exciting researches that arises from algebraic topology. Particularly, the dimension of cohomology groups is a highly useful invariant which plays a rigorous role in the geometric classification of associative algebras. This work focuses on the applications of low dimensional cohomology groups. In this regards, the cohomology groups of degree zero and degree one of nilpotent associative algebras in dimension four are described in matrix form.
This study emphasizes the infinite-boundary integro-differential equation. To examine the approximate solution of the problem, two modified optimization algorithms are proposed based on generalized Laguerre functions. In the first technique, the proposed method is applied to the original problem by approximating the solution using the truncated generalized Laguerre polynomial of the unknown function, optimizing coefficients through error minimization, and transforming the integro-differential equation into an algebraic equation. In contrast, the second approach incorporates a penalty term into the objective function to effectively enforce boundary and integral constraints. This technique reduces the original problem to a mathematical optimi
... Show MoreIn this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.
The aim of this paper is to propose a reliable iterative method for resolving many types of Volterra - Fredholm Integro - Differential Equations of the second kind with initial conditions. The series solutions of the problems under consideration are obtained by means of the iterative method. Four various problems are resolved with high accuracy to make evident the enforcement of the iterative method on such type of integro differential equations. Results were compared with the exact solution which exhibits that this technique was compatible with the right solutions, simple, effective and easy for solving such problems. To evaluate the results in an iterative process the MATLAB is used as a math program for the calculations.