The Algebraic Operation of SVD

Author(s):  
Gidon Eshel

Chapter 4 discussed the eigenvalue/eigenvector diagonalization of a matrix. Perhaps the biggest problem for this to be very useful in data analysis is the restriction to square matrices. It has already been emphasized time and again that data matrices, unlike dynamical operators, are rarely square. The algebraic operation of the singular value decomposition (SVD) is the answer. Note the distinction between the data analysis method widely known as SVD and the actual algebraic machinery. The former uses the latter, but is not the latter. This chapter describes the method. Following the introduction to SVD, it provides some examples and applications.

Geophysics ◽  
1994 ◽  
Vol 59 (7) ◽  
pp. 1083-1091 ◽  
Author(s):  
Simone G. C. Fraiha ◽  
João B. C. Silva

We present an empirical ambiguity analysis method based on a finite number of acceptable solutions that are representative of the ambiguity region. These solutions are submitted to a Q‐mode factor analysis that indicates which parameters are ambiguous and their ambiguity range. We illustrate, with a synthetic nonlinear example, that our method is more effective than singular value decomposition analysis in producing an average trend of the ambiguity region. It requires less restrictive hypotheses and is more robust than analytical methods of ambiguity analysis, in the sense of being applicable to a broader class of problems.


Sign in / Sign up

Export Citation Format

Share Document