This paper presents a gradient based iterative algorithm for Sylvester-conjugate matrix equations with a unique solution. By introducing a relaxation parameter and applying the hierarchical identification principle, an iterative algorithm is constructed to solve Sylvester matrix equations. By applying a real representation of a complex matrix as a tool and using some properties of the real representation, convergence analysis indicates that the iterative solutions converge to the exact solutions for any initial values under certain assumptions.Numerical examples are given to illustrate the efficiency of the proposed approach.
展开▼
机译:Discussion of 'Maximum Gradient Decision-Making for Railways Based on Convolutional Neural Network' by Hao Pu, Hong Zhang, Paul Schonfeld, Wei Li, Jie Wang, Xianbao Peng, and Jianping Hu
机译:Gradient lokalizacji kwasu askorbinowegowjabłkujakofunkcjaprzynależnościodmianowej[Gradient de la localization de l'acide ascorbique dans la pomme,Consideécomme fonction delavarietéetudiée]