Comparison of Computation Period for Some Newtonian Fluid Flow Problems by Elzaki, Sumudu and Laplace Transform
Abstract
![](/public/site/graph.png)
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
Copyright (c) 2019 Muhammad Saqlain, Sadia Fareed, Naveed Jafar, Asma Riffat, Ghulam Murtaza
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.