A binary powering Schur algorithm for computing primary matrix roots

An algorithm for computing primary roots of a nonsingular matrix A is presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalues, using real arithmetic. The algorithm is based on the Schur decomposition of A and has an order of complexity lower than the customary Schur based algorithm, namely the Smith algorithm. Keywords matrix pth root · matrix functions · Schur method · binary powering technique Mathematics Subject Classification (2000) 65F30 · 15A15

• Type: Journal
• Year: 2010
• Where: NA
• Authors: Federico Greco, Bruno Iannazzo
• Keywords: Algorithm, Matrix, NA 2010, Schur