Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Adisorn Kittisopaporn"'
Publikováno v:
AIMS Mathematics, Vol 7, Iss 5, Pp 8471-8490 (2022)
We consider the two-dimensional space-time fractional differential equation with the Caputo's time derivative and the Riemann-Liouville space derivatives on bounded domains. The equation is subjected to the zero Dirichlet boundary condition and the z
Externí odkaz:
https://doaj.org/article/b29b1351e6c64ce392054fca0561eb93
Publikováno v:
Advances in Difference Equations, Vol 2021, Iss 1, Pp 1-18 (2021)
Abstract This paper proposes an effective gradient-descent iterative algorithm for solving a generalized Sylvester-transpose equation with rectangular matrix coefficients. The algorithm is applicable for the equation and its interesting special cases
Externí odkaz:
https://doaj.org/article/c2a445bc1b4a46c2b20bb3ca5938e44b
Publikováno v:
Advances in Difference Equations, Vol 2021, Iss 1, Pp 1-17 (2021)
Abstract We derive an iterative procedure for solving a generalized Sylvester matrix equation A X B + C X D = E $AXB+CXD = E$ , where A , B , C , D , E $A,B,C,D,E$ are conforming rectangular matrices. Our algorithm is based on gradients and hierarchi
Externí odkaz:
https://doaj.org/article/1a80bfb6b0a5441c8c62a04db494d348
Publikováno v:
Advances in Difference Equations, Vol 2020, Iss 1, Pp 1-24 (2020)
Abstract In this paper, we introduce a new iterative algorithm for solving a generalized Sylvester matrix equation of the form ∑ t = 1 p A t X B t = C $\sum_{t=1}^{p}A_{t}XB_{t}=C$ which includes a class of linear matrix equations. The objective of
Externí odkaz:
https://doaj.org/article/4c974249bfba4f5891a268203cd06e0e
Publikováno v:
Advances in Difference Equations, Vol 2020, Iss 1, Pp 1-17 (2020)
Abstract We introduce an effective iterative method for solving rectangular linear systems, based on gradients along with the steepest descent optimization. We show that the proposed method is applicable with any initial vectors as long as the coeffi
Externí odkaz:
https://doaj.org/article/f2d3534be0884e60915b0dd64988e7ca
Publikováno v:
Advances in Difference Equations, Vol 2021, Iss 1, Pp 1-18 (2021)
This paper proposes an effective gradient-descent iterative algorithm for solving a generalized Sylvester-transpose equation with rectangular matrix coefficients. The algorithm is applicable for the equation and its interesting special cases when the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::149e85f2848a95c3e679b990b03fa77d
https://doaj.org/article/c2a445bc1b4a46c2b20bb3ca5938e44b
https://doaj.org/article/c2a445bc1b4a46c2b20bb3ca5938e44b
Publikováno v:
Advances in Difference Equations, Vol 2021, Iss 1, Pp 1-17 (2021)
We derive an iterative procedure for solving a generalized Sylvester matrix equation$AXB+CXD = E$AXB+CXD=E, where$A,B,C,D,E$A,B,C,D,Eare conforming rectangular matrices. Our algorithm is based on gradients and hierarchical identification principle. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68612c397a181f316ba86771665ed04b
https://doi.org/10.1186/s13662-020-03185-9
https://doi.org/10.1186/s13662-020-03185-9
Publikováno v:
Advances in Difference Equations, Vol 2020, Iss 1, Pp 1-17 (2020)
We introduce an effective iterative method for solving rectangular linear systems, based on gradients along with the steepest descent optimization. We show that the proposed method is applicable with any initial vectors as long as the coefficient mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b67e04a17d622da92ce6c1177b079b4
https://doi.org/10.1186/s13662-020-02715-9
https://doi.org/10.1186/s13662-020-02715-9