### James Demmel, Ming Gu, Stanley Eisenstat, Ivan Slapnicar, Kresimir Veselic and Zlatco Drmac

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/CSD-97-934

February 1997

### http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/CSD-97-934.pdf

We analyze when it is possible to compute the singular values and singular vectors of a matrix with high relative accuracy. This means that each computed singular value is guaranteed to have some correct digits, even if the singular values have widely varying magnitudes. This is in contrast to the absolute accuracy provided by conventional backward stable algorithms, which in general only guarantee correct digits in the singular values with large enough magniturds. It is of interest to compute the tiniest singular values with several correct digits, because in some cases, such as finite element problems and quantum mechanics, it is the smallest singular values that have physical meaning, and should be determined accurately by the data. Many recent papers have identified special classes of matrices where high relative accuracy is possible, since it is not possible in general. The perturbation theory and algorithms for these matrix classes have been quite different, motivating us to seek a common perturbation theory and common algorithm. We provide these in this paper, and show that high relative accuracy is possible in many new cases as well. The briefest way to describe our results is that we can compute the SVD to high relative accuracy provided we can compute a "high accuracy" pivoted LDU decomposition. We provide many examples of matrix classes permitting such an LDU decomposition.

BibTeX citation:

@techreport{Demmel:CSD-97-934, Author = {Demmel, James and Gu, Ming and Eisenstat, Stanley and Slapnicar, Ivan and Veselic, Kresimir and Drmac, Zlatco}, Title = {Computing the Singular Value Decomposition with High Relative Accuracy}, Institution = {EECS Department, University of California, Berkeley}, Year = {1997}, Month = {Feb}, URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/5373.html}, Number = {UCB/CSD-97-934}, Abstract = {We analyze when it is possible to compute the singular values and singular vectors of a matrix with high relative accuracy. This means that each computed singular value is guaranteed to have some correct digits, even if the singular values have widely varying magnitudes. This is in contrast to the absolute accuracy provided by conventional backward stable algorithms, which in general only guarantee correct digits in the singular values with large enough magniturds. It is of interest to compute the tiniest singular values with several correct digits, because in some cases, such as finite element problems and quantum mechanics, it is the smallest singular values that have physical meaning, and should be determined accurately by the data. Many recent papers have identified special classes of matrices where high relative accuracy is possible, since it is not possible in general. The perturbation theory and algorithms for these matrix classes have been quite different, motivating us to seek a common perturbation theory and common algorithm. We provide these in this paper, and show that high relative accuracy is possible in many new cases as well. The briefest way to describe our results is that we can compute the SVD to high relative accuracy provided we can compute a "high accuracy" pivoted LDU decomposition. We provide many examples of matrix classes permitting such an LDU decomposition.} }

EndNote citation:

%0 Report %A Demmel, James %A Gu, Ming %A Eisenstat, Stanley %A Slapnicar, Ivan %A Veselic, Kresimir %A Drmac, Zlatco %T Computing the Singular Value Decomposition with High Relative Accuracy %I EECS Department, University of California, Berkeley %D 1997 %@ UCB/CSD-97-934 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/5373.html %F Demmel:CSD-97-934