default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamid Esmaeili
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Hamid Esmaeili, Davoud Moazami:
Application of Hilbert-Schmidt SVD approach to solve linear two-dimensional Fredholm integral equations of the second kind. Comput. Appl. Math. 39(2) (2020)- [j12]Raziyeh Erfanifar
, Khosro Sayevand, Hamid Esmaeili:
On modified two-step iterative method in the fractional sense: some applications in real world phenomena. Int. J. Comput. Math. 97(10): 2109-2141 (2020)
2010 – 2019
- 2019
- [j11]Hamid Esmaeili, Davoud Moazami:
A kernel-based technique to solve three-dimensional linear Fredholm integral equations of the second kind over general domains. Comput. Appl. Math. 38(4) (2019) - 2018
- [j10]Hamid Esmaeili, Majid Rostami, Morteza Kimiaei:
Combining line search and trust-region methods for ℓ1-minimization. Int. J. Comput. Math. 95(10): 1950-1972 (2018) - 2017
- [j9]Hamid Esmaeili, A. Pirnia:
An efficient quadratically convergent iterative method to find the Moore-Penrose inverse. Int. J. Comput. Math. 94(6): 1079-1088 (2017) - 2016
- [j8]Hamid Esmaeili, Morteza Kimiaei:
A trust-region method with improved adaptive radius for systems of nonlinear equations. Math. Methods Oper. Res. 83(1): 109-125 (2016) - [j7]Morteza Kimiaei, Hamid Esmaeili:
A trust-region approach with novel filter adaptive radius for system of nonlinear equations. Numer. Algorithms 73(4): 999-1016 (2016) - 2015
- [j6]Hamid Esmaeili, Mehdi Ahmadi:
An efficient three-step method to solve system of nonlinear equations. Appl. Math. Comput. 266: 1093-1101 (2015) - [j5]Hamid Esmaeili, Morteza Kimiaei:
An efficient adaptive trust-region method for systems of nonlinear equations. Int. J. Comput. Math. 92(1): 151-166 (2015) - 2013
- [j4]Masoud Ahookhosh, Hamid Esmaeili, Morteza Kimiaei:
An effective trust-region-based approach for symmetric nonlinear systems. Int. J. Comput. Math. 90(3): 671-690 (2013) - 2011
- [j3]Hamid Esmaeili:
A class of iterative methods for computing polar decomposition. Int. J. Comput. Math. 88(1): 207-220 (2011)
2000 – 2009
- 2005
- [j2]Hamid Esmaeili:
How can we solve a linear Diophantine equation by the basis reduction algorithm. Int. J. Comput. Math. 82(10): 1227-1234 (2005) - 2001
- [j1]Hamid Esmaeili, Nezam Mahdavi-Amiri, Emilio Spedicato:
A class of ABS algorithms for Diophantine linear systems. Numerische Mathematik 90(1): 101-115 (2001)
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 2025-01-21 00:17 CET 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:
