Higher order convergent algorithms with applications to polynomials and matrices

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

New stable higher order algorithms for computing matrix nth root are presented. Specifically, a generalization of Denman-Beaver iteration for matrix square and cubic roots are given. The new iterations are obtained by change of variables applied to variations of Newton's method and higher order methods. Extensions of these methods for orthonormalization of a rectangular matrix with respect to a positive definite matrix are also given.

Original languageEnglish (US)
Title of host publicationISCAS 2006
Subtitle of host publication2006 IEEE International Symposium on Circuits and Systems, Proceedings
Pages3698-3701
Number of pages4
StatePublished - Dec 1 2006
EventISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems - Kos, Greece
Duration: May 21 2006May 24 2006

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
ISSN (Print)0271-4310

Other

OtherISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems
CountryGreece
CityKos
Period5/21/065/24/06

Keywords

  • Denman-beaver iteration
  • Matrix nth root
  • Matrix sign function
  • Newton's method
  • Orthonormalization

Fingerprint Dive into the research topics of 'Higher order convergent algorithms with applications to polynomials and matrices'. Together they form a unique fingerprint.

Cite this