Somayeh Pourghanbar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Somayeh Pourghanbar has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Aynura Aliyeva
Sumgayit State University, Baku Str., 1, Sumgayit AZ5008, Azerbaijan
1 shared publication - Jalil Manafian
Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Tabriz, Tabriz, Iran
1 shared publication - Mojtaba Ranjbar
Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran
1 shared publication - Yusif Soltan Gasimov
Department of Mathematics and Informatics, Azerbaijan University, AZ1007 Baku, Azerbaijan
1 shared publication
Latest Publications
- Open Access
- 23 November 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-12
An Efficient Alternating Direction Explicit Method for Solving a Nonlinear Partial Differential Equation
In this paper, the Saul’yev finite difference scheme for a fully nonlinear partial differential equation with initial and boundary conditions is analyzed. The main advantage of this scheme is that it is unconditionally stable and explicit. Consistency and monotonicity of the scheme are discussed. Several finite difference schemes are used to compare the Saul’yev scheme with them. Numerical illustrations are given to demonstrate the efficiency and robustness of the scheme. In each case, it is found that the elapsed time for the Saul’yev scheme is shortest, and the solution by the Saul’yev scheme is nearest to the Crank–Nicolson method.
- 23 November 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-12
Open AccessAn Efficient Alternating Direction Explicit Method for Solving a Nonlinear Partial Differential Equation
In this paper, the Saul’yev finite difference scheme for a fully nonlinear partial differential equation with initial and boundary conditions is analyzed. The main advantage of this scheme is that it is unconditionally stable and explicit. Consistency and monotonicity of the scheme are discussed. Several finite difference schemes are used to compare the Saul’yev scheme with them. Numerical illustrations are given to demonstrate the efficiency and robustness of the scheme. In each case, it is found that the elapsed time for the Saul’yev scheme is shortest, and the solution by the Saul’yev scheme is nearest to the Crank–Nicolson method.