default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMuhammad Zaid Dauhoo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j11]Yusra Bibi Ruhomally, Muhammad Zaid Dauhoo:
The NERA model incorporating cellular automata approach and the analysis of the resulting induced stochastic mean field. Comput. Appl. Math. 39(4) (2020)
2010 – 2019
- 2019
- [j10]Jean-Marc Ginoux
, Roomila Naeck, Yusra Bibi Ruhomally, Muhammad Zaid Dauhoo, Matjaz Perc:
Chaos in a predator-prey-based mathematical model for illicit drug consumption. Appl. Math. Comput. 347: 502-513 (2019) - 2016
- [j9]Noure-Roukayya Badurally Adam, Muhammad Zaid Dauhoo, Abdel Anwar Hossen Khoodaruth, Mohammad Khalil Elahee:
A two-stage stochastic programming optimisation for sugar-ethanol-electricity production from sugarcane: a case study of Mauritius. Int. J. Math. Model. Numer. Optimisation 7(1): 20-32 (2016) - [j8]Muhammad Zaid Dauhoo, Diksha Juggurnath, Noure-Roukayya Badurally Adam:
The stochastic evolution of rumors within a population. Math. Soc. Sci. 82: 85-96 (2016) - 2010
- [j7]Arshad Ahmud Iqbal Peer, Muhammad Zaid Dauhoo, Ashvin Gopaul, Muddun Bhuruth:
A weighted ENO-flux limiter scheme for hyperbolic conservation laws. Int. J. Comput. Math. 87(15): 3467-3488 (2010) - [j6]D. K. R. Babajee, Muhammad Zaid Dauhoo, Mohammad Taghi Darvishi, A. Karami, Ali Barati:
Analysis of two Chebyshev-like third order methods free from second derivatives for solving systems of nonlinear equations. J. Comput. Appl. Math. 233(8): 2002-2012 (2010) - [j5]Diyashvir Kreetee Rajiv Babajee, Muhammad Zaid Dauhoo:
Convergence and spectral analysis of the Frontini-Sormani family of multipoint third order methods from quadrature rule. Numer. Algorithms 53(4): 467-484 (2010)
2000 – 2009
- 2009
- [j4]Arshad Ahmud Iqbal Peer, Muhammad Zaid Dauhoo, Muddun Bhuruth:
A method for improving the performance of the WENO5 scheme near discontinuities. Appl. Math. Lett. 22(11): 1730-1733 (2009) - [j3]D. K. R. Babajee, Muhammad Zaid Dauhoo:
Spectral analysis of the errors of some families of multi-step Newton-like methods. Numer. Algorithms 52(1): 25-46 (2009) - 2008
- [j2]D. K. R. Babajee, Muhammad Zaid Dauhoo, Mohammad Taghi Darvishi, Ali Barati:
A note on the local convergence of iterative methods based on Adomian decomposition method and 3-node quadrature rule. Appl. Math. Comput. 200(1): 452-458 (2008) - 2007
- [c2]Appanah Rao Appadu, Muhammad Zaid Dauhoo:
A Note on the Two Versions of Lax-Friedrichs Scheme. CSC 2007: 55-61 - [c1]Appanah Rao Appadu, Muhammad Zaid Dauhoo, S. D. D. V. Rughooputh:
Efficient Shock-Capturing Numerical Schemes Using the Approach of Minimised Integrated Square Difference Error for Hyperbolic Conservation Laws. ICCSA (3) 2007: 774-789 - 2006
- [j1]D. K. R. Babajee, Muhammad Zaid Dauhoo:
An analysis of the properties of the variants of Newton's method with third order convergence. Appl. Math. Comput. 183(1): 659-684 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
