default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDF. Khaksar Haghani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j15]Mohammad Ali Manian, Shahram Heidarian, Farhad Khaksar Haghani
:
Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs. AKCE Int. J. Graphs Comb. 20(1): 57-60 (2023)- 2018
- [j14]Fazlollah Soleymani, Mahdiar Barfeie, Farhad Khaksar Haghani:
Inverse multi-quadric RBF for computing the weights of FD method: Application to American options. Commun. Nonlinear Sci. Numer. Simul. 64: 74-88 (2018) - 2017
- [j13]Alicia Cordero, Fazlollah Soleymani, Juan R. Torregrosa, F. Khaksar Haghani:
A family of Kurchatov-type methods and its stability. Appl. Math. Comput. 294: 264-279 (2017) - [j12]Fayyaz Ahmad, Fazlollah Soleymani, F. Khaksar Haghani, Stefano Serra-Capizzano:
Higher order derivative-free iterative methods with and without memory for systems of nonlinear equations. Appl. Math. Comput. 314: 199-211 (2017) - 2016
- [j11]Malik Zaka Ullah, Sajad Kosari, Fazlollah Soleymani, F. Khaksar Haghani, A. S. Al-Fhaid:
A super-fast tri-parametric iterative method with memory. Appl. Math. Comput. 289: 486-491 (2016) - [j10]Predrag S. Stanimirovic, Fazlollah Soleymani, F. Khaksar Haghani:
Computing outer inverses by scaled matrix iterations. J. Comput. Appl. Math. 296: 89-101 (2016) - 2015
- [j9]Fazlollah Soleymani, Taher Lotfi, E. Tavakoli, F. Khaksar Haghani:
Several iterative methods with memory using self-accelerators. Appl. Math. Comput. 254: 452-458 (2015) - [j8]F. Khaksar Haghani:
A generalized Steffensen's method for matrix sign function. Appl. Math. Comput. 260: 249-256 (2015) - [j7]Mahdi Sharifi, M. Arab, F. Khaksar Haghani:
Finding generalized inverses by a fast and efficient numerical method. J. Comput. Appl. Math. 279: 187-191 (2015) - [j6]Farhad Khaksar Haghani:
On Generalized Traub's Method for Absolute Value Equations. J. Optim. Theory Appl. 166(2): 619-625 (2015) - 2014
- [j5]Farhad Khaksar Haghani:
A Third-Order Newton-Type Method for Finding Polar Decomposition. Adv. Numer. Anal. 2014: 576325:1-576325:5 (2014) - [j4]Fazlollah Soleymani, Emran Tohidi, Stanford Shateyi, F. Khaksar Haghani:
Some Matrix Iterations for Computing Matrix Sign Function. J. Appl. Math. 2014: 425654:1-425654:9 (2014) - [j3]Taher Lotfi, Fazlollah Soleymani, Somayeh Sharifi, Stanford Shateyi, F. Khaksar Haghani:
Multipoint Iterative Methods for Finding All the Simple Zeros in an Interval. J. Appl. Math. 2014: 601205:1-601205:13 (2014) - [j2]Fazlollah Soleymani, Mahdi Sharifi, Stanford Shateyi, F. Khaksar Haghani:
A Class of Steffensen-Type Iterative Methods for Nonlinear Systems. J. Appl. Math. 2014: 705375:1-705375:9 (2014) - 2009
- [j1]Esfandiar Eslami, Farhad Khaksar Haghani:
Pure Filters and Stable Topology on BL-algebras. Kybernetika 45(3): 491-506 (2009)
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-08-18 00:32 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:
