default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasoud Hajarian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j67]Raziyeh Erfanifar, Masoud Hajarian:
High-efficiency parametric iterative schemes for solving nonlinear equations with and without memory. J. Complex. 86: 101896 (2025)- 2024
- [j66]Raziyeh Erfanifar, Masoud Hajarian:
Several efficient iterative algorithms for solving nonlinear tensor equation X+AT*N X-1*N A=I with Einstein product. Comput. Appl. Math. 43(2): 84 (2024) - [j65]Hojjatollah Shokri Kaveh
, Masoud Hajarian, Anthony T. Chronopoulos:
Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms. Comput. Appl. Math. 43(6): 360 (2024) - [j64]Raziyeh Erfanifar, Masoud Hajarian:
On sign function of tensors with Einstein product and its application in solving Yang-Baxter tensor equation. Comput. Appl. Math. 43(6): 373 (2024) - [j63]Shahabeddin Najafi, Masoud Hajarian:
Multiobjective BFGS method for optimization on Riemannian manifolds. Comput. Optim. Appl. 87(2): 337-354 (2024) - [j62]Raziyeh Erfanifar, Masoud Hajarian:
Fixed-Point Iteration Schemes to Solve Symmetric Algebraic Riccati Equation XBX-XA-ATX-C=0. Circuits Syst. Signal Process. 43(6): 3516-3532 (2024) - [j61]Hojjatollah Shokri Kaveh, Masoud Hajarian, Anthony T. Chronopoulos:
Developing variable s-step CGNE and CGNR algorithms for non-symmetric linear systems. J. Frankl. Inst. 361(14): 107071 (2024) - [j60]Fahimeh Alipour, Mohammad Reza Eslahchi, Masoud Hajarian:
A New Prediction-Correction Primal-Dual Hybrid Gradient Algorithm for Solving Convex Minimization Problems with Linear Constraints. J. Math. Imaging Vis. 66(3): 231-245 (2024) - [j59]Shahabeddin Najafi, Masoud Hajarian:
An improved Riemannian conjugate gradient method and its application to robust matrix completion. Numer. Algorithms 96(4): 1887-1900 (2024) - [j58]Raziyeh Erfanifar, Masoud Hajarian:
Splitting iteration methods to solve non-symmetric algebraic Riccati matrix equation YAY-YB-CY+D=0. Numer. Algorithms 97(2): 753-778 (2024) - [j57]Raziyeh Erfanifar, Masoud Hajarian:
A new multi-step method for solving nonlinear systems with high efficiency indices. Numer. Algorithms 97(2): 959-984 (2024) - [j56]Fariba Balani Bakrani, Luca Bergamaschi, Ángeles Martínez, Masoud Hajarian:
Some preconditioning techniques for a class of double saddle point problems. Numer. Linear Algebra Appl. 31(4) (2024) - [j55]Mehri Pakmanesh, Hamidreza Afshin, Masoud Hajarian:
Normalized Newton method to solve generalized tensor eigenvalue problems. Numer. Linear Algebra Appl. 31(4) (2024) - 2023
- [j54]Fariba Bakrani Balani, Masoud Hajarian:
A new block preconditioner for weighted Toeplitz regularized least-squares problems. Int. J. Comput. Math. 100(12): 2241-2250 (2023) - [j53]Raziyeh Erfanifar, Masoud Hajarian:
Weight splitting iteration methods to solve quadratic nonlinear matrix equation MY2+NY+P=0. J. Frankl. Inst. 360(3): 1904-1928 (2023) - [j52]Shahabeddin Najafi, Masoud Hajarian:
Multiobjective Conjugate Gradient Methods on Riemannian Manifolds. J. Optim. Theory Appl. 197(3): 1229-1248 (2023) - 2022
- [j51]Shahram Hosseini, M. Navabi, Masoud Hajarian:
A robust meta-heuristic adaptive Bi-CGSTAB algorithm to online estimation of a three DoF state-space model in the presence of disturbance and uncertainty. Int. J. Syst. Sci. 53(4): 833-850 (2022) - [j50]Raziyeh Erfanifar, Khosro Sayevand, Masoud Hajarian:
An efficient inversion-free method for solving the nonlinear matrix equation Xp+∑j=1mAj*X-qjAj=Q. J. Frankl. Inst. 359(7): 3071-3089 (2022) - [j49]Raziyeh Erfanifar, Khosro Sayevand, Masoud Hajarian:
Convergence analysis of Newton method without inversion for solving discrete algebraic Riccati equations. J. Frankl. Inst. 359(14): 7540-7561 (2022) - [j48]Soheila Ghoroghi Shafiei, Masoud Hajarian:
An iterative method based on ADMM for solving generalized Sylvester matrix equations. J. Frankl. Inst. 359(15): 8155-8170 (2022) - [j47]Soheila Ghoroghi Shafiei, Masoud Hajarian:
Developing Kaczmarz method for solving Sylvester matrix equations. J. Frankl. Inst. 359(16): 8991-9005 (2022) - [j46]Hassan Bozorgmanesh, Masoud Hajarian:
Triangular Decomposition of CP Factors of a Third-Order Tensor with Application to Solving Nonlinear Systems of Equations. J. Sci. Comput. 90(1): 74 (2022) - [j45]Hossein Zare, Masoud Hajarian:
An efficient Gauss-Newton algorithm for solving regularized total least squares problems. Numer. Algorithms 89(3): 1049-1073 (2022) - [j44]Fariba Bakrani Balani, Masoud Hajarian:
On the generalized AOR and CG iteration methods for a class of block two-by-two linear systems. Numer. Algorithms 90(2): 669-685 (2022) - 2021
- [j43]Masoud Hajarian:
Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems. Comput. Appl. Math. 40(4) (2021) - 2020
- [j42]Hassan Bozorgmanesh, Masoud Hajarian:
Solving tensor E-eigenvalue problem faster. Appl. Math. Lett. 100 (2020) - [j41]Hassan Bozorgmanesh, Masoud Hajarian, Anthony Theodore Chronopoulos:
Interval tensors and their application in solving multi-linear systems of equations. Comput. Math. Appl. 79(3): 697-715 (2020) - [j40]Masoud Hajarian:
Conjugate gradient-like methods for solving general tensor equation with Einstein product. J. Frankl. Inst. 357(7): 4272-4285 (2020) - [j39]Zeynab Dalvand, Masoud Hajarian, José E. Román:
An extension of the Cayley transform method for a parameterized generalized inverse eigenvalue problem. Numer. Linear Algebra Appl. 27(6) (2020) - [j38]Masoud Hajarian:
Partially doubly symmetric solutions of general Sylvester matrix equations. Trans. Inst. Meas. Control 42(3): 503-517 (2020) - 2019
- [j37]Masoud Hajarian:
An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems. J. Comput. Appl. Math. 346: 418-431 (2019) - [j36]Masoud Hajarian:
Three types of biconjugate residual method for general periodic matrix equations over generalized bisymmetric periodic matrices. Trans. Inst. Meas. Control 41(10): 2708-2725 (2019) - 2018
- [j35]Masoud Hajarian:
Periodic conjugate direction algorithm for symmetric periodic solutions of general coupled periodic matrix equations. Comput. Math. Appl. 75(11): 4151-4178 (2018) - [j34]Masoud Hajarian:
Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm. Comput. Math. Appl. 76(4): 686-700 (2018) - [j33]Masoud Hajarian, Hassan Abbas:
Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints. Comput. Math. Appl. 76(6): 1458-1475 (2018) - [j32]Masoud Hajarian:
Solving constrained quadratic inverse eigenvalue problem via conjugate direction method. Comput. Math. Appl. 76(10): 2384-2401 (2018) - [j31]Masoud Hajarian:
Finding solutions for periodic discrete-time generalized coupled Sylvester matrix equations via the generalized BCR method. Trans. Inst. Meas. Control 40(2): 647-656 (2018) - 2017
- [j30]Masoud Hajarian:
Convergence of HS version of BCR algorithm to solve the generalized Sylvester matrix equation over generalized reflexive matrices. J. Frankl. Inst. 354(5): 2340-2357 (2017) - 2016
- [j29]Masoud Hajarian:
Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method. Appl. Math. Lett. 52: 87-95 (2016) - [j28]Masoud Hajarian:
Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations. J. Frankl. Inst. 353(5): 1168-1185 (2016) - [j27]Masoud Hajarian:
Symmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithm. J. Frankl. Inst. 353(13): 3233-3248 (2016) - [j26]Masoud Hajarian:
Least Squares Solution of the Linear Operator Equation. J. Optim. Theory Appl. 170(1): 205-219 (2016) - [j25]Hamid Moghaderi, Mehdi Dehghan, Masoud Hajarian:
A fast and efficient two-grid method for solving d-dimensional poisson equations. Numer. Algorithms 72(3): 483-537 (2016) - [j24]Masoud Hajarian:
Generalized conjugate direction algorithm for solving the general coupled matrix equations over symmetric matrices. Numer. Algorithms 73(3): 591-609 (2016) - [j23]Hassan Bozorgmanesh, Masoud Hajarian:
Convergence of a transition probability tensor of a higher-order Markov chain to the stationary probability vector. Numer. Linear Algebra Appl. 23(6): 972-988 (2016) - 2015
- [j22]Masoud Hajarian:
A Finite Iterative Method for Solving the General Coupled Discrete-Time Periodic Matrix Equations. Circuits Syst. Signal Process. 34(1): 105-125 (2015) - [j21]Masoud Hajarian:
Finite algorithms for solving the coupled Sylvester-conjugate matrix equations over reflexive and Hermitian reflexive matrices. Int. J. Syst. Sci. 46(3): 488-502 (2015) - [j20]Shi-Liang Wu, Shu-Qian Shen, Masoud Hajarian, Jia Liu, Lev A. Krukier:
Numerical Methods of Complex Valued Linear Algebraic System. J. Appl. Math. 2015: 979234:1-979234:2 (2015) - 2014
- [j19]Masoud Hajarian:
Matrix form of the CGS method for solving general coupled matrix equations. Appl. Math. Lett. 34: 37-42 (2014) - [j18]Masoud Hajarian:
Developing Bi-CG and Bi-CR Methods to Solve Generalized Sylvester-transpose Matrix Equations. Int. J. Autom. Comput. 11(1): 25-29 (2014) - 2013
- [j17]Masoud Hajarian:
The generalized QMRCGSTAB algorithm for solving Sylvester-transpose matrix equations. Appl. Math. Lett. 26(10): 1013-1017 (2013) - [j16]Masoud Hajarian:
Efficient Iterative Solutions to General Coupled Matrix Equations. Int. J. Autom. Comput. 10(5): 481-486 (2013) - [j15]Masoud Hajarian:
Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations. J. Frankl. Inst. 350(10): 3328-3341 (2013) - 2012
- [j14]Mehdi Dehghan, Masoud Hajarian:
The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices. Int. J. Syst. Sci. 43(8): 1580-1590 (2012) - 2011
- [j13]Mehdi Dehghan, Masoud Hajarian:
Two algorithms for finding the Hermitian reflexive and skew-Hermitian solutions of Sylvester matrix equations. Appl. Math. Lett. 24(4): 444-449 (2011) - [j12]Mehdi Dehghan, Masoud Hajarian:
Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems. J. Comput. Appl. Math. 235(15): 4325-4336 (2011) - 2010
- [j11]Mehdi Dehghan, Masoud Hajarian:
Matrix equations over (R, S)-symmetric and (R, S)-skew symmetric matrices. Comput. Math. Appl. 59(11): 3583-3594 (2010) - [j10]Mehdi Dehghan, Masoud Hajarian:
New iterative method for solving non-linear equations with fourth-order convergence. Int. J. Comput. Math. 87(4): 834-839 (2010) - [j9]Mehdi Dehghan, Masoud Hajarian:
On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations. Int. J. Syst. Sci. 41(6): 607-625 (2010) - [j8]Mehdi Dehghan, Masoud Hajarian:
An efficient algorithm for solving general coupled matrix equations and its application. Math. Comput. Model. 51(9-10): 1118-1134 (2010) - [j7]Mehdi Dehghan, Masoud Hajarian:
Computing matrix functions using mixed interpolation methods. Math. Comput. Model. 52(5-6): 826-836 (2010) - 2009
- [j6]Mehdi Dehghan, Masoud Hajarian:
A lower bound for the product of eigenvalues of solutions to matrix equations. Appl. Math. Lett. 22(12): 1786-1788 (2009) - [j5]Mehdi Dehghan, Masoud Hajarian:
Determination of a matrix function using the divided difference method of Newton and the interpolation technique of Hermite. J. Comput. Appl. Math. 231(1): 67-81 (2009) - [j4]Mehdi Dehghan, Masoud Hajarian:
Finite iterative algorithms for the reflexive and anti-reflexive solutions of the matrix equation A1X1B1+A2X2B2=C. Math. Comput. Model. 49(9-10): 1937-1959 (2009) - [j3]Mehdi Dehghan, Masoud Hajarian:
Convergence of SSOR methods for linear complementarity problems. Oper. Res. Lett. 37(3): 219-223 (2009) - 2008
- [j2]Mehdi Dehghan, Masoud Hajarian:
An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation. Appl. Math. Comput. 202(2): 571-588 (2008) - [j1]Mehdi Dehghan, Masoud Hajarian:
An iterative algorithm for solving a pair of matrix equations AYB=E, CYD=F over generalized centro-symmetric matrices. Comput. Math. Appl. 56(12): 3246-3260 (2008)
Informal and Other Publications
- 2023
- [i1]Fariba Bakrani Balani, Luca Bergamaschi, Angeles Martinez, Masoud Hajarian:
Some preconditioning techniques for a class of double saddle point problems. CoRR abs/2307.00525 (2023)
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-10-15 21:36 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:
