The generalized Newton iteration for the matrix sign function


Journal Article

In this paper we present modified algorithms for computing deflating subspaces of matrix pairs using the matrix sign function. Our new algorithms achieve a considerable reduction of the computational cost of the generalized Newton iteration for the matrix sign function and improve the accuracy of the computed deflating subspaces. The matrix sign function is thus revealed as an effective technique for applications in which bases for the deflating subspaces are required. When partial or complete information about the eigenspectrum is desired, the matrix sign function can be used as an initial divide-and-conquer technique. The basic kernels involved in this iteration are especially appropriate for current high-performance architectures.

Full Text

Duke Authors

Cited Authors

  • Sun, X; Quintana-Ortí, ES

Published Date

  • April 21, 2003

Published In

Volume / Issue

  • 24 / 2

Start / End Page

  • 669 - 683

International Standard Serial Number (ISSN)

  • 1064-8275

Digital Object Identifier (DOI)

  • 10.1137/S1064827598348696

Citation Source

  • Scopus