Othman Mahdi Salih
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Othman Mahdi Salih has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Majeed Ahmed Al-Jawary
Department of Mathematics, College of Education for Pure Sciences Ibn Al-Haitham, University of Baghdad, Baghdad, Iraq
4 shared publications - Ghadeer Jasim Mohammed Mahdi
Department of Mathematics, College of education for Pure Sciences- ibn Al-Haitham, University of Baghdad, Iraq
1 shared publication
Latest Publications
- Open Access
- 30 June 2024
- Published by University of Baghdad College of Science in Iraqi Journal of Science
- p. 3345-3377
Efficient Computational Methods for Solving the One-Dimensional Parabolic Equation with Nonlocal Initial and Boundary Conditions
The primary objective of the current paper is to suggest and implement effective computational methods (DECMs) to calculate analytic and approximate solutions to the nonlocal one-dimensional parabolic equation which is utilized to model specific real-world applications. The powerful and elegant methods that are used orthogonal basis functions to describe the solution as a double power series have been developed, namely the Bernstein, Legendre, Chebyshev, Hermite, and Bernoulli polynomials. Hence, a specified partial differential equation is reduced to a system of linear algebraic equations that can be solved by using Mathematica®12. The techniques of effective computational methods (DECMs) have been applied to solve some specific cases of time-dependent diffusion equations. Moreover, the maximum absolute error () is determined to demonstrate the accuracy of the proposed techniques.
- 30 June 2024
- Published by University of Baghdad College of Science in Iraqi Journal of Science
- p. 3345-3377
Open AccessEfficient Computational Methods for Solving the One-Dimensional Parabolic Equation with Nonlocal Initial and Boundary Conditions
The primary objective of the current paper is to suggest and implement effective computational methods (DECMs) to calculate analytic and approximate solutions to the nonlocal one-dimensional parabolic equation which is utilized to model specific real-world applications. The powerful and elegant methods that are used orthogonal basis functions to describe the solution as a double power series have been developed, namely the Bernstein, Legendre, Chebyshev, Hermite, and Bernoulli polynomials. Hence, a specified partial differential equation is reduced to a system of linear algebraic equations that can be solved by using Mathematica®12. The techniques of effective computational methods (DECMs) have been applied to solve some specific cases of time-dependent diffusion equations. Moreover, the maximum absolute error () is determined to demonstrate the accuracy of the proposed techniques.
- Open Access
- 30 August 2023
- Published by University of Baghdad College of Science in Iraqi Journal of Science
- p. 4070-4091
Computational methods for solving nonlinear ordinary differential equations arising in engineering and applied sciences
In this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between the methods has been presented. In addition, the maximum error remainder () has been computed to demonstrate the accuracy of the proposed methods. The results persuasively prove that CM and D-CMs are reliable and accurate in obtaining the approximate solutions to the problems, with obvious superiority in accuracy for D-CMs than for CM.
- 30 August 2023
- Published by University of Baghdad College of Science in Iraqi Journal of Science
- p. 4070-4091
Open AccessComputational methods for solving nonlinear ordinary differential equations arising in engineering and applied sciences
In this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between the methods has been presented. In addition, the maximum error remainder () has been computed to demonstrate the accuracy of the proposed methods. The results persuasively prove that CM and D-CMs are reliable and accurate in obtaining the approximate solutions to the problems, with obvious superiority in accuracy for D-CMs than for CM.
- Open Access
- 1 June 2023
- Published by College of Science for Women, University of Baghdad in Baghdad Science Journal
- Vol. 20 (3) , 0853-866
Effective Computational Methods for Solving the Jeffery-Hamel Flow Problem
في هذا البحث، تم تنفيذ الطريقة الحسابية الفعالة (ECM) المستندة إلى متعددة الحدود القياسية الأحادية لحل مشكلة تدفق جيفري-هامل غير الخطية. علاوة على ذلك، تم تطوير واقتراح الطرق الحسابية الفعالة الجديدة في هذه الدراسة من خلال وظائف أساسية مناسبة وهي متعددات الحدود تشيبشيف، بيرنشتاين، ليجندر، هيرمت. يؤدي استخدام الدوال الأساسية إلى تحويل المسألة غير الخطية إلى نظام جبري غير خطي من المعادلات، والذي يتم حله بعد ذلك باستخدام برنامج ماثماتيكا®١٢. تم تطبيق تطوير طرق حسابية فعالة (D-ECM) لحل مشكلة تدفق جيفري-هامل غير الخطية، ثم تم عرض مقارنة بين الطرق. علاوة على ذلك، تم حساب الحد الأقصى للخطأ المتبقي ( )، لإظهار موثوقية الطرق المقترحة. تثبت النتائج بشكل مقنع أن ECM و D-ECM دقيقة وفعالة وموثوقة للحصول على حلول تقريبية للمشكلة.
- 1 June 2023
- Published by College of Science for Women, University of Baghdad in Baghdad Science Journal
- Vol. 20 (3) , 0853-866
Open AccessEffective Computational Methods for Solving the Jeffery-Hamel Flow Problem
في هذا البحث، تم تنفيذ الطريقة الحسابية الفعالة (ECM) المستندة إلى متعددة الحدود القياسية الأحادية لحل مشكلة تدفق جيفري-هامل غير الخطية. علاوة على ذلك، تم تطوير واقتراح الطرق الحسابية الفعالة الجديدة في هذه الدراسة من خلال وظائف أساسية مناسبة وهي متعددات الحدود تشيبشيف، بيرنشتاين، ليجندر، هيرمت. يؤدي استخدام الدوال الأساسية إلى تحويل المسألة غير الخطية إلى نظام جبري غير خطي من المعادلات، والذي يتم حله بعد ذلك باستخدام برنامج ماثماتيكا®١٢. تم تطبيق تطوير طرق حسابية فعالة (D-ECM) لحل مشكلة تدفق جيفري-هامل غير الخطية، ثم تم عرض مقارنة بين الطرق. علاوة على ذلك، تم حساب الحد الأقصى للخطأ المتبقي ( )، لإظهار موثوقية الطرق المقترحة. تثبت النتائج بشكل مقنع أن ECM و D-ECM دقيقة وفعالة وموثوقة للحصول على حلول تقريبية للمشكلة.
- Open Access
- 1 June 2022
- Published by College of Science for Women, University of Baghdad in Baghdad Science Journal
- Vol. 19 (3) , 0551
Variable Selection Using aModified Gibbs Sampler Algorithm with Application on Rock Strength Dataset
Variable selection is an essential and necessary task in the statistical modeling field. Several studies have triedto develop and standardize the process of variable selection, but it isdifficultto do so. The first question a researcher needs to ask himself/herself what are the most significant variables that should be used to describe a given dataset’s response. In thispaper, a new method for variable selection using Gibbs sampler techniqueshas beendeveloped.First, the model is defined, and the posterior distributions for all the parameters are derived.The new variable selection methodis tested usingfour simulation datasets. The new approachiscompared with some existingtechniques: Ordinary Least Squared (OLS), Least Absolute Shrinkage and Selection Operator (Lasso), and Tikhonov Regularization (Ridge). The simulation studiesshow that the performance of our method is better than the othersaccording to the error and the time complexity. Thesemethodsare applied to a real dataset, which is called Rock StrengthDataset.The new approach implemented using the Gibbs sampler is more powerful and effective than other approaches.All the statistical computations conducted for this paper are done using R version 4.0.3 on a single processor computer.
- 1 June 2022
- Published by College of Science for Women, University of Baghdad in Baghdad Science Journal
- Vol. 19 (3) , 0551
Open AccessVariable Selection Using aModified Gibbs Sampler Algorithm with Application on Rock Strength Dataset
Variable selection is an essential and necessary task in the statistical modeling field. Several studies have triedto develop and standardize the process of variable selection, but it isdifficultto do so. The first question a researcher needs to ask himself/herself what are the most significant variables that should be used to describe a given dataset’s response. In thispaper, a new method for variable selection using Gibbs sampler techniqueshas beendeveloped.First, the model is defined, and the posterior distributions for all the parameters are derived.The new variable selection methodis tested usingfour simulation datasets. The new approachiscompared with some existingtechniques: Ordinary Least Squared (OLS), Least Absolute Shrinkage and Selection Operator (Lasso), and Tikhonov Regularization (Ridge). The simulation studiesshow that the performance of our method is better than the othersaccording to the error and the time complexity. Thesemethodsare applied to a real dataset, which is called Rock StrengthDataset.The new approach implemented using the Gibbs sampler is more powerful and effective than other approaches.All the statistical computations conducted for this paper are done using R version 4.0.3 on a single processor computer.
- Open Access
- 4 January 2021
- Published by IIUM Press in IIUM Engineering Journal
- Vol. 22 (1) , 138-166
RELIABLE ITERATIVE METHODS FOR SOLVING 1D, 2D AND 3D FISHER’S EQUATION
In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (HPM), or any assumptions to deal with the nonlinear term. The obtained solutions are in recursive sequence forms which can be used to achieve the closed or approximate form of the solutions. Also, the fixed point theorem was presented to assess the convergence of the proposed methods. Several examples of 1D, 2D and 3D problems are solved either analytically or numerically, where the efficiency of the numerical solution has been verified by evaluating the absolute error and the maximum error remainder to show the accuracy and efficiency of the proposed methods. The results reveal that the proposed iterative methods are effective, reliable, time saver and applicable for solving the problems and can be proposed to solve other nonlinear problems. All the iterative process in this work implemented in MATHEMATICA®12. ABSTRAK: Kajian ini berkenaan tiga kaedah berulang boleh percaya diberikan dan dilaksanakan bagi menyelesaikan 1D, 2D dan 3D persamaan Fisher. Kaedah Daftardar-Jafari (DJM), kaedah Temimi-Ansari (TAM) dan kaedah pengecutan Banach (BCM) digunakan bagi mendapatkan penyelesaian numerik dan tepat bagi persamaan Fisher. Kaedah berulang boleh percaya di kategorikan dengan pelbagai faedah, seperti bebas daripada terbitan, mengatasi masalah-masalah yang timbul apabila sempadan polinomial bagi mengurus kata tak linear dalam kaedah penguraian Adomian (ADM), tidak memerlukan kiraan pekali Lagrange sebagai kaedah berulang Variasi (VIM) dan tidak perlu bagi membuat homotopi sebagaimana dalam kaedah gangguan Homotopi (HPM), atau mana-mana anggapan bagi mengurus kata tak linear. Penyelesaian yang didapati dalam bentuk urutan berulang di mana ianya boleh digunakan bagi mencapai penyelesaian tepat atau hampiran. Juga, teorem titik tetap dibentangkan bagi menaksir kaedah bentuk hampiran. Pelbagai contoh seperti masalah 1D, 2D dan 3D diselesaikan samada secara analitik atau numerik, di mana kecekapan penyelesaian numerik telah ditentu sahkan dengan menilai ralat mutlak dan baki ralat maksimum (MER) bagi menentukan ketepatan dan kecekapan kaedah yang dicadangkan. Dapatan kajian menunjukkan kaedah berulang yang dicadangkan adalah berkesan, boleh percaya, jimat masa dan boleh guna bagi menyelesaikan masalah dan boleh dicadangkan menyelesaikan masalah tak linear lain. Semua proses berulang dalam kerja ini menggunakan MATHEMATICA®12.
- 4 January 2021
- Published by IIUM Press in IIUM Engineering Journal
- Vol. 22 (1) , 138-166
Open AccessRELIABLE ITERATIVE METHODS FOR SOLVING 1D, 2D AND 3D FISHER’S EQUATION
In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (HPM), or any assumptions to deal with the nonlinear term. The obtained solutions are in recursive sequence forms which can be used to achieve the closed or approximate form of the solutions. Also, the fixed point theorem was presented to assess the convergence of the proposed methods. Several examples of 1D, 2D and 3D problems are solved either analytically or numerically, where the efficiency of the numerical solution has been verified by evaluating the absolute error and the maximum error remainder to show the accuracy and efficiency of the proposed methods. The results reveal that the proposed iterative methods are effective, reliable, time saver and applicable for solving the problems and can be proposed to solve other nonlinear problems. All the iterative process in this work implemented in MATHEMATICA®12. ABSTRAK: Kajian ini berkenaan tiga kaedah berulang boleh percaya diberikan dan dilaksanakan bagi menyelesaikan 1D, 2D dan 3D persamaan Fisher. Kaedah Daftardar-Jafari (DJM), kaedah Temimi-Ansari (TAM) dan kaedah pengecutan Banach (BCM) digunakan bagi mendapatkan penyelesaian numerik dan tepat bagi persamaan Fisher. Kaedah berulang boleh percaya di kategorikan dengan pelbagai faedah, seperti bebas daripada terbitan, mengatasi masalah-masalah yang timbul apabila sempadan polinomial bagi mengurus kata tak linear dalam kaedah penguraian Adomian (ADM), tidak memerlukan kiraan pekali Lagrange sebagai kaedah berulang Variasi (VIM) dan tidak perlu bagi membuat homotopi sebagaimana dalam kaedah gangguan Homotopi (HPM), atau mana-mana anggapan bagi mengurus kata tak linear. Penyelesaian yang didapati dalam bentuk urutan berulang di mana ianya boleh digunakan bagi mencapai penyelesaian tepat atau hampiran. Juga, teorem titik tetap dibentangkan bagi menaksir kaedah bentuk hampiran. Pelbagai contoh seperti masalah 1D, 2D dan 3D diselesaikan samada secara analitik atau numerik, di mana kecekapan penyelesaian numerik telah ditentu sahkan dengan menilai ralat mutlak dan baki ralat maksimum (MER) bagi menentukan ketepatan dan kecekapan kaedah yang dicadangkan. Dapatan kajian menunjukkan kaedah berulang yang dicadangkan adalah berkesan, boleh percaya, jimat masa dan boleh guna bagi menyelesaikan masalah dan boleh dicadangkan menyelesaikan masalah tak linear lain. Semua proses berulang dalam kerja ini menggunakan MATHEMATICA®12.