Answers are grounded in this paper and cite their sources.
We first investigate the structures of the square roots of a class of circulant matrices and give classifications of the square roots of these circulant matrices. Then, we develop several algorithms for computing their square roots. We show that our algorithms are faster than the standard algorithm which is based on the Schur decomposition.
No takes yet. Share an insight, caveat, or question.
Ying Mei (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: