An Alternating Directions Implicit method is presented to solve the homogeneous heat diffusion equation when the governing equation is a bi-harmonic equation (X) based on Alternative Direction Implicit (ADI). Numerical results are compared with other results obtained by other numerical (explicit and implicit) methods. We apply these methods it two examples (X): the first one, we apply explicit when the temperature .

Background/objectives: To study the motion equation under all perturbations effect for Low Earth Orbit (LEO) satellite. Predicting a satellite’s orbit is an important part of mission exploration. Methodology: Using 4th order Runge–Kutta’s method this equation was integrated numerically. In this study, the accurate perturbed value of orbital elements was calculated by using sub-steps number m during one revolution, also different step numbers nnn during 400 revolutions. The predication algorithm was applied and orbital elements changing were analyzed. The satellite in LEO influences by drag more than other perturbations regardless nnn through semi-major axis and eccentricity reducing. Findings and novelty/improvement: The results demo

Linear Feedback Shift Register (LFSR) systems are used  widely in stream cipher systems field. Any system of LFSR's which wauldn't be attacked must first construct the system of linear equations of the LFSR unit. In this paper methods are developed to construct a system of linear/nonlinear equations of key generator (a LFSR's system) where the effect of combining (Boolean) function of LFSR is obvious. Before solving the system of linear/nonlinear equations by using one of the known classical methods, we have to test the uniqueness of the solution. Finding the solution to these systems mean finding the initial values of the LFSR's of the generator. Two known generators are used to test and apply the ideas of the paper,

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

We have studied Bayesian method in this paper by using the modified exponential growth model, where this model is more using to represent the growth phenomena. We focus on three of prior functions (Informative, Natural Conjugate, and the function that depends on previous experiments) to use it in the Bayesian method. Where almost of observations for the growth phenomena are depended on one another, which in turn leads to a correlation between those observations, which calls to treat such this problem, called Autocorrelation, and to verified this has been used Bayesian method.

The goal of this study is to knowledge the effect of Autocorrelation on the estimation by using Bayesian method. F

This paper derives the EDITRK4 technique, which is an exponentially fitted diagonally implicit RK method for solving ODEs . This approach is intended to integrate exactly initial value problems (IVPs), their solutions consist of linear combinations of the group functions  and  for exponentially fitting  problems, with  being the problem’s major frequency utilized to improve the precision of the method. The modified  method EDITRK4 is a new three-stage fourth-order exponentially-fitted diagonally implicit approach for solving IVPs with functions that are exponential as solutions. Different forms of -order ODEs must be derived using the modified system, and when the same issue is reduced to a  framework of equations that can be sol

Many 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.

In this paper reliable computational methods (RCMs) based on the monomial stan-dard polynomials have been executed to solve the problem of Jeffery-Hamel flow (JHF). In addition, convenient base functions, namely Bernoulli, Euler and Laguerre polynomials, have been used to enhance the reliability of the computational methods. Using such functions turns the problem into a set of solvable nonlinear algebraic system that MathematicaⓇ12 can solve. The JHF problem has been solved with the help of Improved Reliable Computational Methods (I-RCMs), and a review of the methods has been given. Also, published facts are used to make comparisons. As further evidence of the accuracy and dependability of the proposed methods, the maximum error remainder

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio