Accurately Counting Singular Values of Bidiagonal Matrices and Eigenvalues of Skew-Symmetric Tridiagonal Matrices

@article{Fernando1998AccuratelyCS,
  title={Accurately Counting Singular Values of Bidiagonal Matrices and Eigenvalues of Skew-Symmetric Tridiagonal Matrices},
  author={K. Vince Fernando},
  journal={SIAM J. Matrix Analysis Applications},
  year={1998},
  volume={20},
  pages={373-399}
}

• K. Vince Fernando
• Published 1998 in SIAM J. Matrix Analysis Applications
• DOI:10.1137/S089547989631175X

We have developed algorithms to count singular values of a real bidiagonal matrix which are greater than a specified value. This requires the transformation of the singular value problem to an equivalent symmetric eigenvalue problem. The counting of singular values is paramount in the design of bisectionand multisection-type algorithms for computing singular values on serial and parallel machines. The algorithms are based on the eigenvalues of BBt, BtB, and the 2n × 2n zero–diagonal tridiagonal… CONTINUE READING

View via Publisher

Add to Library

Create Alert

Cite