This paper investigates the recovery for time-dependent coefficient and free boundary for heat equation. They are considered under mass/energy specification and Stefan conditions. The main issue with this problem is that the solution is unstable and sensitive to small contamination of noise in the input data. The Crank-Nicolson finite difference method (FDM) is utilized to solve the direct problem, whilst the inverse problem is viewed as a nonlinear optimization problem. The latter problem is solved numerically using the routine optimization toolbox lsqnonlin from MATLAB. Consequently, the Tikhonov regularization method is used in order to gain stable solutions. The results were compared with their exact solution and tested via root mean squares error (RMSE). We found that the numerical results are accurate and stable.
Abstract
Machining residual stresses correlate very closely with the cutting parameters and the tool geometries. This research work aims to investigate the effect of cutting speed, feed rate and depth of cut on the surface residual stress of steel AISI 1045 after face milling operation. After each milling test, the residual stress on the surface of the workpiece was measured by using X-ray diffraction technique. Design of Experiment (DOE) software was employed using the response surface methodology (RSM) technique with a central composite rotatable design to build a mathematical model to determine the relationship between the input variables and the response. The results showed that both
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show MoreLoad balancing in computer networks is one of the most subjects that has got researcher's attention in the last decade. Load balancing will lead to reduce processing time and memory usage that are the most two concerns of the network companies in now days, and they are the most two factors that determine if the approach is worthy applicable or not. There are two kinds of load balancing, distributing jobs among other servers before processing starts and stays at that server to the end of the process is called static load balancing, and moving jobs during processing is called dynamic load balancing. In this research, two algorithms are designed and implemented, the History Usage (HU) algorithm that statically balances the load of a Loaded
... Show More