SOLVING MATRIX POLYNOMIALS BY NEWTON'S METHOD WITH EXACT LINE SEARCHES

  • Seo, Jong-Hyeon (Department of Mathematics, Pusan National University) ;
  • Kim, Hyun-Min (Department of Mathematics, Pusan National University)
  • Published : 2008.06.25

Abstract

One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form $P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_m$, where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ complex matrices. Newton's method was introduced a useful tool for solving the equation P(X)=0. Here, we suggest an improved approach to solve each Newton step and consider how to incorporate line searches into Newton's method for solving the matrix polynomial. Finally, we give some numerical experiment to show that line searches reduce the number of iterations for convergence.

Acknowledgement

Supported by : Pusan National University