Comparison of Computation Period for Some Newtonian Fluid Flow Problems by Elzaki, Sumudu and Laplace Transform

  • Muhammad Saqlain Lahore Garrison University, Lahore, Pakistan
  • Sadia Fareed Lahore Garrison University, Lahore, Pakistan
  • Naveed Jafar Lahore Garrison University, Lahore, Pakistan
  • Asma Riffat Lahore Garrison University, Lahore, Pakistan
  • Ghulam Murtaza Lahore Garrison University, Lahore, Pakistan
DOI: https://doi.org/10.32350/sir.31.06
Keywords: Newtonian fluid flow problems (NFFPs), stokes’ first problem, Elzaki transform, Laplace transform, Sumudu transform, exact solutions, error function

Abstract

Abstract Views: 118

Newtonian Fluid Flow Problems (NFFPs) of Stokes’ first theorem for suddenly started and suddenly stopped plate are solved by Elzaki Transform Method and the results are identical to those of Laplace Transform and Sumudu Transform. It shows that the said method is very effective due to smaller computation period. The results are verified by graphing the outcome of all the transforms and by calculating their computation period, so that NFFP can be easily solved by Elzaki Transform Method to avoid lengthy calculations.

Downloads

Download data is not yet available.
Published
2019-01-31
How to Cite
1.
Muhammad Saqlain, Sadia Fareed, Naveed Jafar, Asma Riffat, Ghulam Murtaza. Comparison of Computation Period for Some Newtonian Fluid Flow Problems by Elzaki, Sumudu and Laplace Transform. Sci Inquiry Rev. [Internet]. 2019Jan.31 [cited 2024Sep.8];3(1):48-7. Available from: https://journals.umt.edu.pk/index.php/SIR/article/view/304
Issue
Vol 3 No 1 (2019): March
Section
Orignal Article

Copyright (c) 2019 Muhammad Saqlain, Sadia Fareed, Naveed Jafar, Asma Riffat, Ghulam Murtaza

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.