On the spectrum of linear combinations of finitely many diagonalizable matrices that mutually commute (Q2236396)

The authors propose an algorithm, based on the method given in [\textit{E. Kişi} and \textit{H. Özdemir}, Math. Commun. 23, No. 1, 61--78 (2018; Zbl 1392.15028)], to study a special spectral problem for matrices. More precisely, they want to figure out when a linear combination matrix \(X =\sum_{i=1}^m c_iX_i\) is such that its spectrum is a subset of a particular set. Here, \(c_i\) are nonzero scalars and \(X_i\) are mutually commuting diagonalizable matrices A Mathematica implementation code of the algorithm is provided. The problem of characterizing all situations for which a linear combination of some special matrices, e.g., matrices that coincide with some of their powers, is also a special matrix can be solved via the algorithm as well.