Computing the Singular Values of 2-by-2 Complex Matrices

نویسندگان

  • Sanzheng Qiao
  • Xiaohong Wang
چکیده

The singular value decomposition (SVD) of a 2-by-2 complex matrix does not occur as frequently as that of a 2-by-2 real upper triangular matrix. The commonly used QR method for SVD consists of two stages. In the first stage, a matrix is reduced to bidiagonal form using, say, Householder transformations on both sides. In the second stage, the bidiagonal matrix resulted from the first stage is diagonalized using QR iterations, where we deal with the SVDs of 2-by-2 blocks. Since the first stage, we can assume the 2-by-2 blocks real and upper triangular. However, in Jacobi methods, which are suitable for parallel computing, we have to deal with the SVD of 2-by-2 complex matrix if the original matrix is complex. Our algorithm consists of two stages. The first stage reduces B to real and upper triangular:

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

ثبت نام

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

منابع مشابه

Weak log-majorization inequalities of singular values between normal matrices and their absolute values

‎This paper presents two main results that the singular values of the Hadamard product of normal matrices $A_i$ are weakly log-majorized by the singular values of the Hadamard product of $|A_{i}|$ and the singular values of the sum of normal matrices $A_i$ are weakly log-majorized by the singular values of the sum of $|A_{i}|$‎. ‎Some applications to these inequalities are also given‎. ‎In addi...

متن کامل

Singular value inequalities for positive semidefinite matrices

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

Singular values of convex functions of matrices

‎Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $‎sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $‎sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$  are nonzero matrices and each $X_{i}$ is‎ ‎positive semidefinite‎. ‎It is shown that if $f$ is a nonnegative increasing ‎convex function on $left[ 0,infty right) $ satisfying $fleft( 0right)‎ ‎=0 $‎, ‎then  $$‎2s_{j}left( fleft( fra...

متن کامل

Properties of matrices with numerical ranges in a sector

Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...

متن کامل

Accurate Singular Values of Bidiagonal Matrices

2 has nonzero entries only on its diagonal and first superdiagonal ) Compute orthogonal matrices P and Q such that Σ = P BQ is diagonal and nonnegat i 2 2 2 T 2 ive. The diagonal entries σ of Σ are the singular values of A . We will take them to be sorted in decreasing order: σ ≥ σ . The columns of Q= Q Q are the right singular vec i i + 1 1 2 t 1 2 ors, and the columns of P= P P are the left s...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002