In this work, the pseudoparabolic problem of the fourth order is investigated to identify the time -dependent potential term under periodic conditions, namely, the integral condition and overdetermination condition. The existence and uniqueness of the solution to the inverse problem are provided. The proposed method involves discretizing the pseudoparabolic equation by using a finite difference scheme, and an iterative optimization algorithm to resolve the inverse problem which views as a nonlinear least-square minimization. The optimization algorithm aims to minimize the difference between the numerical computing solution and the measured data. Tikhonov’s regularization method is also applied to gain stable results. Two examples are introduced to explain the reliability of the proposed scheme. Finally, the results showed that the time dependent potential terms are successfully reconstructed, stable and accurate, even in inclusion of noise.
Reduce the required time for measuring the permeability of clayey soils by using new manufactured cell
Background: Scientific education aims to be inclusive and to improve students learning achievements, through appropriate teaching and learning. Problem Based Learning (PBL) system, a student centered method, started in the second half of the previous century and is expanding progressively, organizes learning around problems and students learn about a subject through the experience of solving these problems.Objectives:To assess the opinions of undergraduate medical students regarding learning outcomes of PBL in small group teaching and to explore their views about the role of tutors and methods of evaluation. Type of the study: A cross-sectional study.Methods: This study was conducted in Kerbala Medical Colleges among second year students
... Show MoreThis paper provides a four-stage Trigonometrically Fitted Improved Runge-Kutta (TFIRK4) method of four orders to solve oscillatory problems, which contains an oscillatory character in the solutions. Compared to the traditional Runge-Kutta method, the Improved Runge-Kutta (IRK) method is a natural two-step method requiring fewer steps. The suggested method extends the fourth-order Improved Runge-Kutta (IRK4) method with trigonometric calculations. This approach is intended to integrate problems with particular initial value problems (IVPs) using the set functions and for trigonometrically fitted. To improve the method's accuracy, the problem primary frequency is used. The novel method is more accurate than the conventional Runge-Ku
... Show MoreThis paper is concerned with the quaternary nonlinear hyperbolic boundary value problem (QNLHBVP) studding constraints quaternary optimal classical continuous control vector (CQOCCCV), the cost function (CF), and the equality and inequality quaternary state and control constraints vector (EIQSCCV). The existence of a CQOCCCV dominating by the QNLHBVP is stated and demonstrated using the Aubin compactness theorem (ACTH) under appropriate hypotheses (HYPs). Furthermore, mathematical formulation of the quaternary adjoint equations (QAEs) related to the quaternary state equations (QSE) are discovere so as its weak form (WF) . The directional derivative (DD) of the Hamiltonian (Ham) is calculated. The necessary and sufficient conditions for
... Show Morein this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.
In this paper, analyzing the non-dimensional Magnesium-hydrodynamics problem Using nanoparticles in Jeffrey-Hamel flow (JHF) has been studied. The fundamental equations for this issue are reduced to a three-order ordinary differential equation. The current project investigated the effect of the angles between the plates, Reynolds number, nanoparticles volume fraction parameter, and magnetic number on the velocity distribution by using analytical technique known as a perturbation iteration scheme (PIS). The effect of these parameters is similar in the converging and diverging channels except magnetic number that it is different in the divergent channel. Furthermore, the resulting solutions with good convergence and high accuracy for the d
... Show MoreIn this paper we shall generalize fifth explicit Runge-Kutta Feldberg(ERKF(5)) and Continuous explicit Runge-Kutta (CERK) method using shooting method to solve second order boundary value problem which can be reduced to order one.These methods we shall call them as shooting Continuous Explicit Runge-Kutta method, the results are computed using matlab program.
The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits of( FMOLP) algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun
... Show MoreAfter Organization literature era, two literary schools appeared in Turkey and Abdulhaq Hamid is one of this period most prominent poets. During his stay in France with a group of colleagues sent by Turkish Government, he was greatly influenced by the French modern literature and the French modern literary authors.
The study discusses the concept of time in the poetry of Abdulhaq Hamid. Reading his poetry, it can be noticed that time is important where he frequently refers to day and night, morning and evening as time insinuations. Hence, the present paper gives a brief study of the poet’s life, and sheds lights on his poems that deal with time- concept.
Ön Söz
... Show MoreIt is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree). This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method to prove th
... Show More