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 optimization problem, making it easier to manage. The proposed methods are examined through various experiments, including numerical applications such as thermal, pharmacokinetic, oscillatory, aerodynamic, and ecological models, to demonstrate the validity, efficiency, and applicability of the techniques. Error analysis indicates that the approximation becomes more accurate as the number of generalized Laguerre basis functions increases.
This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t
... Show MoreAn efficient modification and a novel technique combining the homotopy concept with Adomian decomposition method (ADM) to obtain an accurate analytical solution for Riccati matrix delay differential equation (RMDDE) is introduced in this paper . Both methods are very efficient and effective. The whole integral part of ADM is used instead of the integral part of homotopy technique. The major feature in current technique gives us a large convergence region of iterative approximate solutions .The results acquired by this technique give better approximations for a larger region as well as previously. Finally, the results conducted via suggesting an efficient and easy technique, and may be addressed to other non-linear problems.
MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order
... Show MoreBased on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.
Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va
... Show MoreThe paper uses the Direct Synthesis (DS) method for tuning the Proportional Integral Derivative (PID) controller for controlling the DC servo motor. Two algorithms are presented for enhancing the performance of the suggested PID controller. These algorithms are Back-Propagation Neural Network and Particle Swarm Optimization (PSO). The performance and characteristics of DC servo motor are explained. The simulation results that obtained by using Matlab program show that the steady state error is eliminated with shorter adjusted time when using these algorithms with PID controller. A comparative between the two algorithms are described in this paper to show their effectiveness, which is found that the PSO algorithm gives be
... Show MoreThis paper demonstrates the construction of a modern generalized Exponential Rayleigh distribution by merging two distributions with a single parameter. The "New generalized Exponential-Rayleigh distribution" specifies joining the Reliability function of exponential pdf with the Reliability function of Rayleigh pdf, and then adding a shape parameter for this distribution. Finally, the mathematical and statistical characteristics of such a distribution are accomplished