Highly accurate symmetric eigenvalue decomposition and hyperbolic SVD

Let G be a m×n real matrix with full column rank and let J be a n×n diagonal matrix of signs, Jii∈{−1,1}. The hyperbolic singular value decomposition (HSVD) of the pair (G,J) is defined as G=UΣV−1, where U is orthogonal, Σ is positive definite diagonal, and V is J-orthogonal matrix, VTJV=J. We analyze when it is possible to compute the HSVD with high relative accuracy. This essentially means that each computed hyperbolic singular value is guaranteed to have some correct digits, even if they have widely varying magnitudes. We show that one-sided J-orthogonal Jacobi method method computes the HSVD with high relative accuracy. More precisely, let B=GD−1, where D is diagonal such that the columns of B have unit norms. Essentially, we show that the computed hyperbolic singular values of the pair (G,J) will have log10(e/σmin(B)) correct decimal digits, where e is machine precision. We give the necessary relative perturbation bounds and error analysis of the algorithm. Our numerical tests confirmed all theoretical results. For the symmetric non-singular eigenvalue problem Hx=λx, we analyze the two-step algorithm which consists of factorization H=GJGT followed by the computation of the HSVD of the pair (G,J). Here G is square and non-singular. Let B=DG, where D is diagonal such that the rows of B have unit norms, and let B be defined as above. Essentially, we show that the computed eigenvalues of H will have log10(e/σ2min(B)+e/σmin(B)) correct decimal digits. This accuracy can be much higher then the one obtained by the classical QR and Jacobi methods applied to H, where the accuracy depends on the spectral condition number of H, particularly if the matrices B and B are well conditioned, and we are interested in the accurate computation of tiny eigenvalues. Again, we give the perturbation and error bounds, and our theoretical predictions are confirmed by a series of numerical experiments.We also give the corresponding results for eigenvectors and hyperbolic singular vectors.

[1]  James Demmel,et al.  Jacobi's Method is More Accurate than QR , 1989, SIAM J. Matrix Anal. Appl..

[2]  W. Kahan,et al.  The Rotation of Eigenvectors by a Perturbation. III , 1970 .

[3]  Ed Anderson,et al.  LAPACK Users' Guide , 1995 .

[4]  Stanley C. Eisenstat,et al.  A Divide-and-Conquer Algorithm for the Bidiagonal SVD , 1995, SIAM J. Matrix Anal. Appl..

[5]  Ren-Cang Li,et al.  Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations , 1996, SIAM J. Matrix Anal. Appl..

[6]  Haesun Park,et al.  Fast Plane Rotations with Dynamic Scaling , 1994, SIAM J. Matrix Anal. Appl..

[7]  Ivan Slapničar,et al.  A bound for the condition of a hyperbolic eigenvector matrix , 1999 .

[8]  H. Zha A note on the existence of the hyperbolic singular value decomposition , 1996 .

[9]  Ivan Slapničar,et al.  Relative perturbation theory for hyperbolic eigenvalue problem , 2000 .

[10]  W. Gragg,et al.  On computing accurate singular values and eigenvalues of acyclic matrices , 1992 .

[11]  G. Stewart,et al.  Matrix Perturbation Theory , 1990 .

[12]  A. Sluis Condition numbers and equilibration of matrices , 1969 .

[13]  Gene H. Golub,et al.  Matrix computations , 1983 .

[14]  K. Veselié A Jacobi eigenreduction algorithm for definite matrix pairs , 1993 .

[15]  Vjeran Hari,et al.  On quadratic convergence bounds for theJ-symmetric Jacobi method , 1993 .

[16]  J. H. Wilkinson The algebraic eigenvalue problem , 1966 .

[17]  W. Gragg,et al.  On computing accurate singular values and eigenvalues of matrices with acyclic graphs , 1992 .

[18]  Stanley C. Eisenstat,et al.  A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem , 1995, SIAM J. Matrix Anal. Appl..

[19]  Ivan Slapničar,et al.  Componentwise Analysis of Direct Factorization of Real Symmetric and Hermitian Matrices , 1998 .

[20]  Roy Mathias Accurate Eigensystem Computations by Jacobi Methods , 1995, SIAM J. Matrix Anal. Appl..

[21]  Z. Drmač Accurate Computation of the Product-Induced Singular Value Decomposition with Applications , 1998 .

[22]  James Demmel,et al.  Accurate Singular Values of Bidiagonal Matrices , 1990, SIAM J. Sci. Comput..

[23]  Ivan Slapničar,et al.  Floating-point perturbations of Hermitian matrices , 1993 .

[24]  H. Rutishauser The Jacobi method for real symmetric matrices , 1966 .

[25]  J. Demmel,et al.  Computing the Singular Value Decomposition with High Relative Accuracy , 1997 .

[26]  J. Barlow,et al.  Computing accurate eigensystems of scaled diagonally dominant matrices: LAPACK working note No. 7 , 1988 .

[27]  J. Bunch,et al.  Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[28]  B. Parlett The Symmetric Eigenvalue Problem , 1981 .

[29]  Ivan Slapničar,et al.  Accurate Symmetric Eigenreduction by a Jacobi Method , 1993 .

[30]  Allan O. Steinhardt,et al.  The hyberbolic singular value decomposition and applications , 1990, Fifth ASSP Workshop on Spectrum Estimation and Modeling.

[31]  Ivan Slapničar,et al.  Relative perturbation bound for invariant subspaces of graded indefinite Hermitian matrices , 1999 .

[32]  Z. Drmač A posteriori computation of the singular vectors in a preconditioned Jacobi SVD algorithm , 1999 .