Faezeh Toutounian
Orcid: 0000-0003-4805-7850
According to our database1,
Faezeh Toutounian
authored at least 36 papers
between 1998 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis.
Numer. Algorithms, 2021
2020
An extended block Golub-Kahan algorithm for large algebraic and differential matrix Riccati equations.
Comput. Math. Appl., 2020
2019
LSMR iterative method for solving one- and two-dimensional linear Fredholm integral equations.
Comput. Appl. Math., 2019
2018
The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides.
J. Comput. Appl. Math., 2018
Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides.
Comput. Math. Appl., 2018
2017
Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides.
J. Comput. Appl. Math., 2017
An iterative method for solving the continuous sylvester equation by emphasizing on the skew-hermitian parts of the coefficient matrices.
Int. J. Comput. Math., 2017
Appl. Math. Comput., 2017
2016
A shifted nested splitting iterative method with applications to ill-posed problems and image restoration.
Comput. Math. Appl., 2016
2015
A fast convergent numerical method for matrix sign function with application in SDEs.
J. Comput. Appl. Math., 2015
2014
Convergence analysis of Bernoulli matrix approach for one-dimensional matrix hyperbolic equations of the first order.
Comput. Math. Appl., 2014
A new method based on generalized Taylor expansion for computing a series solution of the linear systems.
Appl. Math. Comput., 2014
Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning.
Adv. Comput. Math., 2014
2013
Recursive self preconditioning method based on Schur complement for Toeplitz matrices.
Numer. Algorithms, 2013
Nested splitting conjugate gradient method for matrix equation <i>A</i><i>X</i><i>B</i>=<i>C</i>AXB=C and preconditioning.
Comput. Math. Appl., 2013
Adv. Numer. Anal., 2013
A new Bernoulli matrix method for solving second order linear partial differential equations with the convergence analysis.
Appl. Math. Comput., 2013
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., 2013
2012
Accelerated Circulant and Skew Circulant Splitting Methods for Hermitian Positive Definite Toeplitz Systems.
Adv. Numer. Anal., 2012
2011
Int. J. Comput. Math., 2011
2009
A Hybrid of the Newton-GMRES and Electromagnetic Meta-Heuristic Methods for Solving Systems of Nonlinear Equations.
J. Math. Model. Algorithms, 2009
2008
Math. Comput. Simul., 2008
2007
Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matricies.
Appl. Math. Comput., 2007
A new version of successive approximations method for solving Sylvester matrix equations.
Appl. Math. Comput., 2007
2006
Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides.
Appl. Math. Comput., 2006
Numerical accuracy of a certain class of iterative methods for solving linear system.
Appl. Math. Comput., 2006
A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations.
Appl. Math. Comput., 2006
The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides.
Appl. Math. Comput., 2006
Preconditioned Galerkin and minimal residual methods for solving Sylvester equations.
Appl. Math. Comput., 2006
2005
Approximate inverse preconditioner by computing approximate solution of Sylvester equation.
Appl. Math. Comput., 2005
1998
The stable A<sup>T</sup>A-orthogonal <i>s</i>-step Orthomin(k) algorithm with the CADNA library.
Numer. Algorithms, 1998