default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAzita Tajaddini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j12]Yasin Hashemi-Nazari
, Azita Tajaddini, Farid Saberi-Movahed, Fernando Alonso-Fernandez, Prayag Tiwari:
Robust oblique projection and weighted NMF for hyperspectral unmixing. Pattern Recognit. 170: 112029 (2026)- 2025
- [j11]Mahsa Bagheri, Faranges Kyanfar, Abbas Salemi, Azita Tajaddini:
A modified block Hessenberg method for low-rank tensor Sylvester equation. J. Comput. Appl. Math. 456: 116209 (2025) - [j10]Yasin Hashemi-Nazari, Farid Saberi-Movahed, Azita Tajaddini, Catarina Moreira, Xin Ning, Prayag Tiwari:
Simultaneous outlier detection and elimination in hyperspectral unmixing via weighted non-negative matrix tri-factorization. Mach. Learn. 114(7): 157 (2025) - 2024
- [j9]Mahsa Bagheri, Azita Tajaddini, Faranges Kyanfar, Abbas Salemi:
Alternative Arnoldi process for ill-conditioned tensor equations with application to image restoration. Comput. Appl. Math. 43(6): 375 (2024) - [j8]Azita Tajaddini, Farid Saberi-Movahed, Xian-Ming Gu, Mohammed Heyouni:
On applying deflation and flexible preconditioning to the adaptive Simpler GMRES method for Sylvester tensor equations. J. Frankl. Inst. 361(17): 107268 (2024) - 2021
- [j7]Azita Tajaddini, Gang Wu, Farid Saberi Movahed, Najmeh Azizi Zadeh:
Two New Variants of the Simpler Block GMRES Method with Vector Deflation and Eigenvalue Deflation for Multiple Linear Systems. J. Sci. Comput. 86(1): 9 (2021) - [j6]Lakhdar Elbouyahyaoui, Mohammed Heyouni, Azita Tajaddini, Farid Saberi Movahed:
On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems. Numer. Algorithms 87(3): 1257-1299 (2021) - 2020
- [j5]Mohammed Heyouni, Farid Saberi Movahed, Azita Tajaddini:
A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations. J. Comput. Appl. Math. 377: 112878 (2020)
2010 – 2019
- 2019
- [j4]Mohammed Heyouni, Farid Saberi Movahed, Azita Tajaddini:
On global Hessenberg based methods for solving Sylvester matrix equations. Comput. Math. Appl. 77(1): 77-92 (2019) - [j3]Najmeh Azizi Zadeh, Azita Tajaddini, Gang Wu:
Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations. Numer. Algorithms 82(1): 155-181 (2019) - 2017
- [i1]Najmeh Azizi Zadeh, Azita Tajaddini, Gang Wu:
A weighted global GMRES algorithm with deflation for solving large Sylvester matrix equations. CoRR abs/1706.01176 (2017) - 2015
- [j2]Majid Zerafat Angiz L., Adli Mustafa, Mohammad Ghadiri, Azita Tajaddini:
Relationship between efficiency in the traditional data envelopment analysis and possibility sets. Comput. Ind. Eng. 81: 140-146 (2015) - 2012
- [j1]M. Zerafat Angiz L., Azita Tajaddini, Adli Mustafa, M. Jalal Kamali:
Ranking alternatives in a preferential voting system using fuzzy concepts and data envelopment analysis. Comput. Ind. Eng. 63(4): 784-790 (2012)
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-11-22 05:19 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:
