Preferred Language
Articles
/
M-bvH5wBmraWrQ4d5kdk
Modified Optimization Algorithms for Infinite Integro-Differential Equations via Generalized Laguerre Polynomials
...Show More Authors

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.

Scopus Crossref
View Publication
Publication Date
Mon Feb 01 2021
Journal Name
University Of Baghdad, College Of Education For Pure Sciences / Ibn Al-haitham, Department Of Mathematics
Generalized Rough Digraphs and Related Topologies1
...Show More Authors

In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th

... Show More
Publication Date
Sat Oct 28 2023
Journal Name
Baghdad Science Journal
Generalized Left Derivations with Identities on Near-Rings
...Show More Authors

In this paper, new concepts which are called: left derivations and generalized left derivations in nearrings have been defined. Furthermore, the commutativity of the 3-prime near-ring which involves some
algebraic identities on generalized left derivation has been studied.

View Publication Preview PDF
Scopus Crossref
Publication Date
Sun Dec 06 2015
Journal Name
Baghdad Science Journal
New Operational Matrices of Seventh Degree Orthonormal Bernstein Polynomials
...Show More Authors

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

View Publication Preview PDF
Crossref
Publication Date
Wed Oct 25 2023
Journal Name
Plos One
Performance enhancement of high order Hahn polynomials using multithreading
...Show More Authors

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 More
View Publication
Scopus (7)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Ieee Access
A New Separable Moments Based on Tchebichef-Krawtchouk Polynomials
...Show More Authors

View Publication
Scopus (22)
Crossref (20)
Scopus Clarivate Crossref
Publication Date
Sun Sep 11 2022
Journal Name
Concurrency And Computation: Practice And Experience
Fast and accurate computation of high‐order Tchebichef polynomials
...Show More Authors

View Publication
Scopus (30)
Crossref (28)
Scopus Clarivate Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
symmetric analysis of multiple variables classified ranked orthogonal polynomials
...Show More Authors

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 More
View Publication Preview PDF
Crossref
Publication Date
Tue Jan 01 2019
Journal Name
International Journal Of Civil Engineering And Technology
Generalized tupled common fixed point theorems for weakly compatible mappings in fuzzy metric space
...Show More Authors

Scopus (11)
Scopus
Publication Date
Sun Dec 01 2019
Journal Name
Journal Of Economics And Administrative Sciences
Use Generalized Pareto Survival Models to Estimation Optimal Survival Time for Myocardial Infarction Patients
...Show More Authors

The survival analysis is one of the modern methods of analysis that is based on the fact that the dependent variable represents time until the event concerned in the study. There are many survival models that deal with the impact of explanatory factors on the likelihood of survival, including the models proposed by the world, David Cox, one of the most important and common models of survival, where it consists of two functions, one of which is a parametric function that does not depend on the survival time and the other a nonparametric function that depends on times of survival, which the Cox model is defined as a semi parametric model, The set of parametric models that depend on the time-to-event distribution parameters such as

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
Retina Based Glowworm Swarm Optimization for Random Cryptographic Key Generation
...Show More Authors

The biometric-based keys generation represents the utilization of the extracted features from the human anatomical (physiological) traits like a fingerprint, retina, etc. or behavioral traits like a signature. The retina biometric has inherent robustness, therefore, it is capable of generating random keys with a higher security level compared to the other biometric traits. In this paper, an effective system to generate secure, robust and unique random keys based on retina features has been proposed for cryptographic applications. The retina features are extracted by using the algorithm of glowworm swarm optimization (GSO) that provides promising results through the experiments using the standard retina databases. Additionally, in order t

... Show More
View Publication Preview PDF
Scopus (11)
Crossref (3)
Scopus Clarivate Crossref