Newton Method for Joint Approximate Diagonalization of Positive Definite Hermitian Matrices

نویسنده

  • Marcel Joho
چکیده

In this paper we present a Newton method to jointly approximately diagonalize a set of positive definite Hermitian matrices. To this end, we derive the local gradient and Hessian of the underlying cost function in closed form. The algorithm is derived for the complex case and can also update a non-square diagonalization matrix. We analyze the cost function at the critical points and show its relation to a different cost function that is commonly studied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagonality Measures of Hermitian Positive-Definite Matrices with Application to the Approximate Joint Diagonalization Problem

In this paper, we introduce properly-invariant diagonality measures of Hermitian positive-definite matrices. These diagonality measures are defined as distances or divergences between a given positive-definite matrix and its diagonal part. We then give closed-form expressions of these diagonality measures and discuss their invariance properties. The diagonality measure based on the log-determin...

متن کامل

Joint diagonalization via subspace fitting techniques

Joint diagonalization problems of Hermitian or non-Hermitian matrices occur as the final parameter estimation step in several blind source separation problems such as ACMA, JADE, PARAFAC, and SOBI. Previous approaches have been Jacobi iteration schemes and alternating projections. Here we show how the joint diagonalization problem can be formulated as a (weighted) subspace fitting problem so th...

متن کامل

Joint Approximate Diagonalization of Positive Deenite Hermitian Matrices

This paper provides an iterative algorithm to jointly approximately di-agonalize K Hermitian positive deenite matrices ? 1 , : : : , ? K. Speciically it calculates the matrix B which minimizes the criterion P K k=1 n k log det diag(BC k B) ? log det(BC k B)], n k being positive numbers, which is a measure of the deviation from diagonality of the matrices BC k B. The convergence of the algorithm...

متن کامل

On Newton-hss Methods for Systems of Nonlinear Equations with Positive-definite Jacobian Matrices

The Hermitian and skew-Hermitian splitting (HSS) method is an unconditionally convergent iteration method for solving large sparse non-Hermitian positive definite system of linear equations. By making use of the HSS iteration as the inner solver for the Newton method, we establish a class of Newton-HSS methods for solving large sparse systems of nonlinear equations with positive definite Jacobi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2008