Explicit iterative algorithms for solving coupled discrete-time Lyapunov matrix equations
MetadataShow full item record
© The Institution of Engineering and Technology 2016.In this study, the authors aim to study explicit iterative algorithms for solving coupled discrete-time Lyapunov matrix equations. First, an explicit iterative algorithm based on fixed point theory of dynamic equations is presented via adding a tuning parameter. Second, a necessary and sufficient condition is provided for the convergence of the proposed algorithm. Moreover, the optimal value of the tuning parameter is derived for the fastest convergence of the algorithm. Third, by using the latest updated information, a modified version of the presented explicit iterative algorithm is also established with a necessary and sufficient condition being provided to guarantee the convergence of the modified algorithm. Finally, a numerical example is given to demonstrate the effectiveness of the proposed algorithms.
Showing items related by title, author, creator and subject.
Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithmsSrar, Jalal Abdulsayed (2011)In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave ...
Li, J.; Li, G.; Wu, Z.; Wu, Changzhi (2016)© 2016 Springer-Verlag Berlin HeidelbergThis paper considers a distributed optimization problem encountered in a time-varying multi-agent network, where each agent has local access to its convex objective function, and ...
Berman, M.; Phatak, Aloke; Lagerstrom, R.; Wood, B. (2009)The iterated constrained endmembers (ICE) algorithm is a new method of unmixing hyperspectral images that combines aspects of multivariate curve resolution (MCR) methods in chemometrics and unmixing algorithms in remote ...