Afficher la notice abrégée

dc.creatorAkritas, A. G.en
dc.creatorMalaschonok, G. I.en
dc.date.accessioned2015-11-23T10:21:53Z
dc.date.available2015-11-23T10:21:53Z
dc.date.issued2004
dc.identifier10.1016/j.matcom.2004.05.005
dc.identifier.issn0378-4754
dc.identifier.urihttp://hdl.handle.net/11615/25412
dc.description.abstractLet A be an m x n matrix with m greater than or equal to n. Then one form of the singular-value decomposition of A is A = U-T SigmaV, where U and V are orthogonal and Sigma is square diagonal. That is, UUT = I-rank(A), VVT = I-rank(A), U is rank(A) x m, V is rank(A) x n and [GRAPHICS] is a rank (A) x rank(A) diagonal matrix. In addition sigma(1) greater than or equal to sigma(2) greater than or equal to... greater than or equal to sigma(rank)(A) > 0. The sigma(i)'s are called the singular values of A and their number is equal to the rank of A. The ratio sigma(1) /sigma(rank)(A) can be regarded as a condition number of the matrix A. It is easily verified that the singular-value decomposition can be also written as [GRAPHICS] The matrix u(i)(T) v(i) is the outerproduct of the i-th row of U with the corresponding row of V. Note that each of these matrices can be stored using only m + n locations rather than mn locations.en
dc.sourceMathematics and Computers in Simulationen
dc.source.uri<Go to ISI>://WOS:000224205900003
dc.subjectapplicationsen
dc.subjectsingular-value decompositionsen
dc.subjecthangeren
dc.subjectstretcheren
dc.subjectaligneren
dc.subjectComputer Science, Interdisciplinary Applicationsen
dc.subjectComputer Science,en
dc.subjectSoftware Engineeringen
dc.subjectMathematics, Applieden
dc.titleApplications of singular-value decomposition (SVD)en
dc.typejournalArticleen


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée