default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFaezeh Toutounian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j35]A. Taherian, Faezeh Toutounian
:
Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis. Numer. Algorithms 88(4): 1831-1850 (2021)- [i1]Reza Godaz, Reza Monsefi, Faezeh Toutounian, Reshad Hosseini:
Accurate and fast matrix factorization for low-rank learning. CoRR abs/2104.10785 (2021) - 2020
- [j34]Zahra Asgari, Faezeh Toutounian, Esmail Babolian, Emran Tohidi:
An extended block Golub-Kahan algorithm for large algebraic and differential matrix Riccati equations. Comput. Math. Appl. 79(8): 2447-2457 (2020)
2010 – 2019
- 2019
- [j33]Zahra Asgari, Faezeh Toutounian, Esmail Babolian, Emran Tohidi:
LSMR iterative method for solving one- and two-dimensional linear Fredholm integral equations. Comput. Appl. Math. 38(3) (2019) - 2018
- [j32]S. Amini, Faezeh Toutounian:
Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides. Comput. Math. Appl. 76(8): 2011-2021 (2018) - [j31]S. Amini, Faezeh Toutounian, Mortaza Gachpazan:
The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides. J. Comput. Appl. Math. 337: 166-174 (2018) - [j30]Neda Mohamadi, Ali Reza Soheili, Faezeh Toutounian:
A new hybrid denoising model based on PDEs. Multim. Tools Appl. 77(10): 12057-12072 (2018) - 2017
- [j29]Faezeh Toutounian, Reza Buzhabadi:
New methods for computing the Drazin-inverse solution of singular linear systems. Appl. Math. Comput. 294: 343-352 (2017) - [j28]Mohammad Khorsand Zak, Faezeh Toutounian:
An iterative method for solving the continuous sylvester equation by emphasizing on the skew-hermitian parts of the coefficient matrices. Int. J. Comput. Math. 94(4): 633-649 (2017) - [j27]Maryam Mojarrab, Faezeh Toutounian:
Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides. J. Comput. Appl. Math. 321: 78-89 (2017) - 2016
- [j26]Mohammad Khorsand Zak, Faezeh Toutounian:
A shifted nested splitting iterative method with applications to ill-posed problems and image restoration. Comput. Math. Appl. 71(1): 213-223 (2016) - 2015
- [j25]Faezeh Toutounian, Davod Khojasteh Salkuyeh, Maryam Mojarrab:
LSMR Iterative Method for General Coupled Matrix Equations. J. Appl. Math. 2015: 562529:1-562529:12 (2015) - [j24]Ali Reza Soheili, Faezeh Toutounian, Fazlollah Soleymani:
A fast convergent numerical method for matrix sign function with application in SDEs. J. Comput. Appl. Math. 282: 167-178 (2015) - 2014
- [j23]Mohammad Khorsand Zak, Faezeh Toutounian:
Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning. Adv. Comput. Math. 40(4): 865-880 (2014) - [j22]Faezeh Toutounian, Hamideh Nasabzadeh:
A new method based on generalized Taylor expansion for computing a series solution of the linear systems. Appl. Math. Comput. 248: 602-609 (2014) - [j21]Emran Tohidi, Faezeh Toutounian:
Convergence analysis of Bernoulli matrix approach for one-dimensional matrix hyperbolic equations of the first order. Comput. Math. Appl. 68(1-2): 1-12 (2014) - 2013
- [j20]Faezeh Toutounian, Emran Tohidi:
A new Bernoulli matrix method for solving second order linear partial differential equations with the convergence analysis. Appl. Math. Comput. 223: 298-310 (2013) - [j19]Faezeh Toutounian, Fazlollah Soleymani:
An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix. Appl. Math. Comput. 224: 671-680 (2013) - [j18]Hamideh Nasabzadeh, Faezeh Toutounian:
Convergent Homotopy Analysis Method for Solving Linear Systems. Adv. Numer. Anal. 2013: 732032:1-732032:6 (2013) - [j17]Mohammad Khorsand Zak, Faezeh Toutounian:
Nested splitting conjugate gradient method for matrix equation AXB=CAXB=C and preconditioning. Comput. Math. Appl. 66(3): 269-278 (2013) - [j16]Faezeh Toutounian, Nasser Akhoundi:
Recursive self preconditioning method based on Schur complement for Toeplitz matrices. Numer. Algorithms 62(3): 505-525 (2013) - 2012
- [j15]Nasser Akhoundi, Faezeh Toutounian:
Accelerated Circulant and Skew Circulant Splitting Methods for Hermitian Positive Definite Toeplitz Systems. Adv. Numer. Anal. 2012: 973407:1-973407:17 (2012) - 2011
- [j14]Saeed Karimi, Faezeh Toutounian:
On the convergence of the Bl-LSQR algorithm for solving matrix equations. Int. J. Comput. Math. 88(1): 171-182 (2011)
2000 – 2009
- 2009
- [j13]Faezeh Toutounian, Jafar Saberi-Nadjafi, S. H. Taheri:
A Hybrid of the Newton-GMRES and Electromagnetic Meta-Heuristic Methods for Solving Systems of Nonlinear Equations. J. Math. Model. Algorithms 8(4): 425-443 (2009) - 2008
- [j12]Davod Khojasteh Salkuyeh, Faezeh Toutounian, Hamed Shariat Yazdi:
A procedure with stepsize control for solving n one-dimensional IVPs. Math. Comput. Simul. 79(2): 167-176 (2008) - 2007
- [j11]Mohammad H. Koulaei, Faezeh Toutounian:
Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matricies. Appl. Math. Comput. 184(2): 223-234 (2007) - [j10]Amer Kaabi, Asghar Kerayechian, Faezeh Toutounian:
A new version of successive approximations method for solving Sylvester matrix equations. Appl. Math. Comput. 186(1): 638-645 (2007) - 2006
- [j9]Davod Khojasteh Salkuyeh, Faezeh Toutounian:
New approaches for solving large Sylvester equations. Appl. Math. Comput. 173(1): 9-18 (2006) - [j8]Davod Khojasteh Salkuyeh, Faezeh Toutounian:
Numerical accuracy of a certain class of iterative methods for solving linear system. Appl. Math. Comput. 176(2): 727-738 (2006) - [j7]Saeed Karimi, Faezeh Toutounian:
The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides. Appl. Math. Comput. 177(2): 852-862 (2006) - [j6]Faezeh Toutounian, Saeed Karimi:
Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides. Appl. Math. Comput. 178(2): 452-460 (2006) - [j5]Davod Khojasteh Salkuyeh, Saeed Karimi, Faezeh Toutounian:
A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations. Appl. Math. Comput. 181(1): 782-792 (2006) - [j4]Amer Kaabi, Faezeh Toutounian, Asghar Kerayechian:
Preconditioned Galerkin and minimal residual methods for solving Sylvester equations. Appl. Math. Comput. 181(2): 1208-1214 (2006) - 2005
- [j3]Davod Khojasteh Salkuyeh, Faezeh Toutounian:
A block version algorithm to approximate inverse factors. Appl. Math. Comput. 162(3): 1499-1509 (2005) - [j2]Amer Kaabi, Asghar Kerayechian, Faezeh Toutounian:
Approximate inverse preconditioner by computing approximate solution of Sylvester equation. Appl. Math. Comput. 170(2): 1067-1076 (2005)
1990 – 1999
- 1998
- [j1]Faezeh Toutounian:
The stable ATA-orthogonal s-step Orthomin(k) algorithm with the CADNA library. Numer. Algorithms 17(1-2): 105-119 (1998)
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-04-29 20:33 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:
