Shahid Beheshti University Computational Mathematics and Computer Modeling with Applications (CMCMA) 2783-4859 1 2 2022 12 01 A hybrid method of successive linearization method (SLM) and collocation method to steady regime of the reaction-diffusion equation 1 7 102617 10.52547/CMCMA.1.2.1 EN Elyas Shivanian Department of Applied Mathematics, Imam Khomeini International University, Qazvin 34148-96818, Iran Eghbal Mohammadi Department of Applied Mathematics, Imam Khomeini International University, Qazvin 34148-96818, Iran Journal Article 2022 07 02 This article presents a method based on combination of successive linearization method (SLM) and pseudo-spectral collocation method and then is applied on a nonlinear model of coupled diffusion and chemical reaction in a spherical catalyst pellet. It is obtained that this method can be used for nonlinear boundary value problems without difficulty because the nonlinear part of the equation becomes inactive by SLM and more, to treat the linear equation, even in the case of complicatedness, is straightforward by pseudo-spectral collocation method. Also, the results reveal the high efficiency with reliable accuracy of this hybrid method. https://cmcma.sbu.ac.ir/article_102617_795722081c466785a1994b78c2b2a6f6.pdf
Shahid Beheshti University Computational Mathematics and Computer Modeling with Applications (CMCMA) 2783-4859 1 2 2022 12 01 An efficient iterative method for finding the Moore-Penrose and Drazin inverse of a matrix 8 19 102767 10.52547/CMCMA.1.2.8 EN Raziyeh Erfanifar Faculty of Mathematics and Statistics, Malayer University, Malayer, Iran. Journal Article 2022 07 28 In this paper, a third order convergent method for finding the Moore-Penrose inverse of a matrix is presented and analysed. Then, we develop the method to find Drazin inversion. This method is very robust to find the Moore-Penrose and Drazin inverse of a matrix. Finally, numerical examples show that the efficiency of the proposed method is superior over other proposed methods. https://cmcma.sbu.ac.ir/article_102767_5fc76e94dfd1398bf9e62e3cf78d08d5.pdf
Shahid Beheshti University Computational Mathematics and Computer Modeling with Applications (CMCMA) 2783-4859 1 2 2022 12 01 A class of efficient derivative free iterative method with and without memory for solving nonlinear equations 20 26 102771 10.52547/CMCMA.1.2.20 EN Raziyeh Erfanifar Faculty of Mathematics and Statistics, Malayer University, Malayer, Iran. Journal Article 2022 08 19 In the present paper, at first, we propose a new two-step iterative method for solving nonlinear equations. This scheme is based on the Steffensen's method, in which the order of convergence is four. This iterative method requires only three functions evaluation in each iteration, therefore it is optimal in the sense of the Kung and Traub conjecture. Then we extend it to the method with memory, which the order of convergence is six. Finally, numerical examples indicate that the<br />obtained methods in terms of accuracy and computational cost are superior to the<br />famous forth-order methods. https://cmcma.sbu.ac.ir/article_102771_0c6fc87358b555518d78b49822fda387.pdf
Shahid Beheshti University Computational Mathematics and Computer Modeling with Applications (CMCMA) 2783-4859 1 2 2022 12 01 Reproducing kernel method for Abel's second kind singular integral equations 27 34 102919 10.52547/CMCMA.1.2.27 EN Nazi Abdollahi Civil Engineering Department, Miaad University, Mahabad, 59141-673635, Iran Saeid Abbasbandy Imam Khomeini Int. University, Qazvin, Iran. 0000-0003-3385-4152 Journal Article 2022 10 18 Singular integral equations (SIEs) are often encountered in certain contact and fracture problems in solid mechanics. In this paper, we apply the reproducing kernel method (RKM) to give the approximate solution of Abel's second-kind singular integral equations. For solving this problem, difficulties lie in its singular term. In order to remove the singular term of the equation, an equivalent transformation is made. Solution representations are obtained in reproducing kernel Hilbert space. Numerical experiments show that our reproducing kernel method is efficient. To show the high accuracy of the method the results are compared to other numerical methods and satisfactory agreements are achieved. https://cmcma.sbu.ac.ir/article_102919_2e17673a0f76e281b2d3998b2145ed4d.pdf
Shahid Beheshti University Computational Mathematics and Computer Modeling with Applications (CMCMA) 2783-4859 1 2 2022 12 01 Newton-Krylov generalized minimal residual algorithm in solving the nonlinear two-dimensional integral equations of the second kind on non-rectangular domains with an error estimate 35 45 103020 10.52547/CMCMA.1.2.35 EN Hafez Yari Department of Computer Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran. Mehdi Delkhosh Department of Mathematics and Computer Science, Bardaskan Branch, Islamic Azad University, Bardaskan, Iran. 0000-0001-6632-4743 Journal Article 2022 10 31 In this paper, an applicable numerical approximation has been proposed for solving nonlinear two-dimensional integral equations (2DIEs) of the second kind on non-rectangular domains. Because directly applying the collocation methods on non-rectangular domains is difficult, in this work, at first, the integral equation is converted to an equal integral equation on a rectangular domain, then the solution is approximated by applying 2D Jacobi collocation method, the implementation of these instructions reduces the integral equation to a system of nonlinear algebraic equations, therefore, solving this system has an important role to approximate the solution. In this paper, Newton-Krylov generalized minimal residual (NK-GMRes) algorithm is used for solving the system of nonlinear algebraic equations. Furthermore, an error estimate for the presented method is investigated and several examples confirm the accuracy and efficiency of the proposed instructions. https://cmcma.sbu.ac.ir/article_103020_b11f4ccd892fbf09f23f8c31b65638f6.pdf
Shahid Beheshti University Computational Mathematics and Computer Modeling with Applications (CMCMA) 2783-4859 1 2 2022 12 01 Numerical investigation of differential biological models via Gaussian RBF collocation method with genetic strategy 46 64 103078 10.52547/CMCMA.1.2.46 EN Fardin Salehi Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran Soleiman Hashemi Shahraki Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran 0000-0002-6179-2254 Mohammad Kazem Fallah &lrm;Department of Computer Engineering, Chosun University, Gwangju 61452, Republic of Korea Mohammad Hemami Department of Cognitive Modelling, Institute for Cognitive and Brain Sciences, Shahid Beheshti University 0000-0001-5548-0281 Journal Article 2022 11 13 In this paper, we use radial basis function collocation method for solving the system of differential equations in the area of biology. One of the challenges in RBF method is picking out an optimal value for shape parameter in Radial basis function to achieve the best result of the method because there are not any available analytical approaches for obtaining optimal shape parameter. For this reason, we design a genetic algorithm to detect a close optimal shape parameter. The population convergence figures, the residuals of the equations and the examination of the ASN2R and ARE measures all show the accurate selection of the shape parameter by the proposed genetic algorithm. Then, the experimental results show that this strategy is efficient in the systems of differential models in biology such as HIV and Influenza. Furthermore, we show that using our pseudo-combination formula for crossover in genetic strategy leads to convergence in the nearly best selection of shape parameter. https://cmcma.sbu.ac.ir/article_103078_d38ef33604ce1a57f37856afdaeb42bb.pdf
Shahid Beheshti University Computational Mathematics and Computer Modeling with Applications (CMCMA) 2783-4859 1 2 2022 12 01 A computational method to solve fractional-order Fokker-Planck equations based on Touchard polynomials 65 73 103191 10.52547/CMCMA.1.2.65 EN Sedigheh Sabermahani Department of Mathematics, Faculty of Mathematical Sciences, Alzahra University, Tehran, Iran 0000-0002-7320-8908 Yadollah Ordokhani Department of Mathematics, Faculty of Mathematical Sciences, Alzahra University, Tehran, Iran Journal Article 2022 10 17 This manuscript presents a new approximation method for fractional-order Fokker-Planck equations based on Touchard polynomial approximation. We provide new Caputo and extra Caputo pseudo-operational matrices for these polynomials. Then, utilizing mentioned pseudo-operational matrices and an optimal method, the considered equation leads to a system of algebraic equations which can be solved by mathematical software. Finally, we illustrate the advantages of the suggested technique through several numerical examples. https://cmcma.sbu.ac.ir/article_103191_a65a15a361eef420f4621f235599453b.pdf