Convergence analysis of a gradient iterative algorithm with optimal convergence factor for a generalized Sylvester-transpose matrix equation
Consider a generalized Sylvester-transpose matrix equation with rectangular coefficient matrices. Based on gradients and hierarchical identification principle, we derive an iterative algorithm to produce a sequence of approximated solutions with a reasonable stopping rule concerning a relative norm-...
Main Authors: | Nunthakarn Boonruangkan, Pattrawut Chansangiam |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2021-06-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2021492?viewType=HTML |
Similar Items
-
Gradient Iterative Method with Optimal Convergent Factor for Solving a Generalized Sylvester Matrix Equation with Applications to Diffusion Equations
by: Nunthakarn Boonruangkan, et al.
Published: (2020-10-01) -
Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
by: Adisorn Kittisopaporn, et al.
Published: (2021-01-01) -
Modified Jacobi-Gradient Iterative Method for Generalized Sylvester Matrix Equation
by: Nopparut Sasaki, et al.
Published: (2020-11-01) -
Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
by: Adisorn Kittisopaporn, et al.
Published: (2021-05-01) -
Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
by: Adisorn Kittisopaporn, et al.
Published: (2020-07-01)