default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFatemeh Shakeri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Faezeh Aghamohammadi, Fatemeh Shakeri
:
Self representation based methods for tensor completion problem. J. Comput. Appl. Math. 457: 116297 (2025)- 2024
- [j14]Sayyed Mohsen Allameh, Fatemeh Shakeri, Seyed Hasan Hosseini:
Investigating the relationship between knowledge management and team performance based on common evaluation framework. Int. J. Knowl. Learn. 17(3): 301-330 (2024) - [j13]Rahim Alizadeh, Shahriar Bijani, Fatemeh Shakeri:
Distributed consensus-based estimation of the leading eigenvalue of a non-negative irreducible matrix. Parallel Comput. 122: 103113 (2024) - [j12]Sepideh Khormaeipour, Fatemeh Shakeri:
A modified hue and range preserving color assignment function with a component-wise saturation adjustment for color image enhancement. Signal Process. Image Commun. 128: 117174 (2024) - [j11]Zahra Gachkooban, Rahim Alizadeh, Fatemeh Shakeri:
Enhancing multidimensional scaling through a distributed algorithm. J. Supercomput. 80(15): 22049-22068 (2024) - 2020
- [j10]Hanieh Tavakolipour, Fatemeh Shakeri:
Asymptotics of the eigenvalues for exponentially parameterized pentadiagonal matrices. Numer. Linear Algebra Appl. 27(6) (2020)
2010 – 2019
- 2019
- [j9]Fatemeh Abdi, Fatemeh Shakeri:
Power iteration and inverse power iteration for eigenvalue complementarity problem. Numer. Linear Algebra Appl. 26(4) (2019) - [j8]Fatemeh Abdi, Fatemeh Shakeri:
A globally convergent BFGS method for pseudo-monotone variational inequality problems. Optim. Methods Softw. 34(1): 25-36 (2019) - 2017
- [j7]Fatemeh Abdi, Fatemeh Shakeri:
A New Descent Method for Symmetric Non-monotone Variational Inequalities with Application to Eigenvalue Complementarity Problems. J. Optim. Theory Appl. 173(3): 923-940 (2017) - 2011
- [j6]Fatemeh Shakeri, Mehdi Dehghan:
The finite volume spectral element method to solve Turing models in the biological pattern formation. Comput. Math. Appl. 62(12): 4322-4336 (2011)
2000 – 2009
- 2009
- [j5]Mehdi Dehghan, Fatemeh Shakeri:
Method of lines solutions of the parabolic inverse problem with an overspecification at a point. Numer. Algorithms 50(4): 417-437 (2009) - 2008
- [j4]Fatemeh Shakeri, Mehdi Dehghan:
The method of lines for solution of the one-dimensional wave equation subject to an integral conservation condition. Comput. Math. Appl. 56(9): 2175-2188 (2008) - [j3]Fatemeh Shakeri, Mehdi Dehghan:
Solution of delay differential equations via a homotopy perturbation method. Math. Comput. Model. 48(3-4): 486-498 (2008) - [j2]Fatemeh Shakeri, Mehdi Dehghan:
Solution of a model describing biological species living together using the variational iteration method. Math. Comput. Model. 48(5-6): 685-699 (2008) - 2007
- [j1]Fatemeh Shakeri, Mehdi Dehghan:
Numerical solution of a biological population model using He's variational iteration method. Comput. Math. Appl. 54(7-8): 1197-1209 (2007)
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-12-02 22:34 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:
