Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Ahmed M. E. Bayoumi"'
Autor:
Ahmed M. E. Bayoumi, Mohamed Ramadan
Publikováno v:
Automatika, Vol 63, Iss 3, Pp 454-462 (2022)
In this work, we are concerned with (R, S) – conjugate solutions to coupled Sylvester complex matrix equations with conjugate of two unknowns. When the considered two matrix equations are consistent, it is demonstrated that the solutions can be obt
Externí odkaz:
https://doaj.org/article/4fd702b82e97454085986a85df49019c
Publikováno v:
Fuzzy Information and Engineering. 12:464-489
In this paper, five iterative methods for solving two coupled fuzzy Sylvester matrix equations are considered. The two coupled fuzzy Sylvester matrix equations are expressed by using the generalize...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::430b2c38a85695e860f50b3c29e0360d
https://doi.org/10.1080/16168658.2021.1923442
https://doi.org/10.1080/16168658.2021.1923442
Publikováno v:
Mathematical Methods in the Applied Sciences. 42:7506-7516
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccb095b333a3886a24183ac57f73ab67
https://doi.org/10.1002/mma.5875
https://doi.org/10.1002/mma.5875
Autor:
Ahmed M. E. Bayoumi
Publikováno v:
Iranian Journal of Science and Technology, Transactions A: Science. 43:2343-2350
In this paper, two relaxed gradient-based algorithms for solving the linear matrix equation $$ AXB + CXD = F $$ and finding the Hermitian and skew-Hermitian solutions are presented. We proved that the algorithms converge to the Hermitian and skew-Her
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::678b79145723531729b63c4922bb5c43
https://doi.org/10.1007/s40995-019-00694-5
https://doi.org/10.1007/s40995-019-00694-5
Autor:
Ahmed M. E. Bayoumi
Publikováno v:
Transactions of the Institute of Measurement and Control. 41:1139-1148
In this paper, we present an iterative algorithm to solve a generalized coupled Sylvester – conjugate matrix equations over Hamiltonian matrices. When the considered systems of matrix equations are consistent, it is proven that the solution can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98865ce49fb15c18131a167de59af04a
https://doi.org/10.1177/0142331218791238
https://doi.org/10.1177/0142331218791238
Publikováno v:
Computers & Mathematics with Applications. 75:3367-3378
In this paper, an iterative algorithm for solving a generalized coupled Sylvester-conjugate matrix equations over Hermitian R -conjugate matrices given by A 1 V B 1 + C 1 W D 1 = E 1 V ¯ F 1 + G 1 and A 2 V B 2 + C 2 W D 2 = E 2 V ¯ F 2 + G 2 is pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f494d81329a009415e1e7329cdafe487
https://doi.org/10.1016/j.camwa.2018.02.003
https://doi.org/10.1016/j.camwa.2018.02.003
Publikováno v:
Asian Journal of Control. 20:228-235
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19ca37cef021268489a7281267319e32
https://doi.org/10.1002/asjc.1574
https://doi.org/10.1002/asjc.1574
Publikováno v:
Transactions of the Institute of Measurement and Control. 40:341-347
In this paper, we present an accelerated gradient-based iterative algorithm for solving extended Sylvester–conjugate matrix equations. The idea is from the gradient-based method introduced in Wu et al. ( Applied Mathematics and Computation 217(1):
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3969cf56d34c53d4fa953f1f175e81e
https://doi.org/10.1177/0142331216658092
https://doi.org/10.1177/0142331216658092
Publikováno v:
Asian Journal of Control. 17:1070-1080
In this paper, we consider explicit and iterative methods for solving the Generalized Sylvester matrix equation AV + BW = EVF + C. Based on the use of Kronecker map and Sylvester sum some lemmas and theorems are stated and proved where explicit and i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0d407596518f60583acae9e3b0a9c1c
https://doi.org/10.1002/asjc.965
https://doi.org/10.1002/asjc.965
Publikováno v:
Mathematical and Computer Modelling. 58:1738-1754
In this paper, we consider two iterative algorithms for the Sylvester-conjugate matrix equation AV+BW=EV¯F+C and AV+BW¯=EV¯F+C. When these two matrix equations are consistent, for any initial matrices the solutions can be obtained within finite it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebc2fdf8027286e9eb8197fe7bd2cb98
https://doi.org/10.1016/j.mcm.2013.06.010
https://doi.org/10.1016/j.mcm.2013.06.010