کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4631004 | 1340614 | 2011 | 11 صفحه PDF | دانلود رایگان |
In the first part of this paper, we investigate the reduced forms of circulant matrices and quasi-skew circulant matrices. By using their properties we present two efficient algorithms to compute the square roots of circulant matrices and quasi-skew circulant matrices, respectively. Those methods are faster than the traditional algorithm which is based on the Schur decomposition. In the second part, we further consider circulant H-matrices with positive diagonal entries and develop two algorithms for computing their principal square roots. Those two algorithms have the common advantage that is they only need matrix–matrix multiplications in their iterative sequences, an operation which can be done very efficiently on modern high performance computers.
Journal: Applied Mathematics and Computation - Volume 217, Issue 16, 15 April 2011, Pages 6819–6829