A binary powering Schur algorithm for computing primary matrix roots

Abstract  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.

• Content Type Journal Article
• Category Original Paper
• DOI 10.1007/s11075-009-9357-1
• Authors
  
  
  • Federico Greco, Università di Perugia Dipartimento di Matematica e Informatica Via Vanvitelli 1 06123 Perugia Italy
  • Bruno Iannazzo, Università di Perugia Dipartimento di Matematica e Informatica Via Vanvitelli 1 06123 Perugia Italy
  
  

• Journal Numerical Algorithms
• Online ISSN 1572-9265
• Print ISSN 1017-1398

Published by

Original source : http://www.springerlink.com/content/e4m7016502378q...