文件名称:cgsvd
-
所属分类:
- 标签属性:
- 上传时间:2015-07-01
-
文件大小:739byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
CGSVD Compact generalized SVD of a matrix pair in regularization problems.
sm = cgsvd(A,L)
[U,sm,X,V] = cgsvd(A,L) , sm = [sigma,mu]
Computes the generalized SVD of the matrix pair (A,L):
[ A ] = [ U 0 ]*[ diag(sigma) 0 ]*inv(X)
[ L ] [ 0 V ] [ 0 eye(n-p) ]
[ diag(mu) 0 ]
where
U is m-by-n , sigma is p-by-1
V is p-by-p , mu is p-by-1
X is n-by-n .
It is assumed that m >= n >= p, which is true in regularization problems.
Reference: C. F. Van Loan, Computing the CS and the generalized
singular value decomposition , Numer. Math. 46 (1985), 479-491.
Per Christian Hansen, IMM, 12/19/97.
Initialization. - CGSVD Compact generalized SVD of a matrix pair in regularization problems.
sm = cgsvd(A,L)
[U,sm,X,V] = cgsvd(A,L) , sm = [sigma,mu]
Computes the generalized SVD of the matrix pair (A,L):
[ A ] = [ U 0 ]*[ diag(sigma) 0 ]*inv(X)
[ L ] [ 0 V ] [ 0 eye(n-p) ]
[ diag(mu) 0 ]
where
U is m-by-n , sigma is p-by-1
V is p-by-p , mu is p-by-1
X is n-by-n .
It is assumed that m >= n >= p, which is true in regularization problems.
Reference: C. F. Van Loan, Computing the CS and the generalized
singular value decomposition , Numer. Math. 46 (1985), 479-491.
Per Christian Hansen, IMM, 12/19/97.
Initialization.
sm = cgsvd(A,L)
[U,sm,X,V] = cgsvd(A,L) , sm = [sigma,mu]
Computes the generalized SVD of the matrix pair (A,L):
[ A ] = [ U 0 ]*[ diag(sigma) 0 ]*inv(X)
[ L ] [ 0 V ] [ 0 eye(n-p) ]
[ diag(mu) 0 ]
where
U is m-by-n , sigma is p-by-1
V is p-by-p , mu is p-by-1
X is n-by-n .
It is assumed that m >= n >= p, which is true in regularization problems.
Reference: C. F. Van Loan, Computing the CS and the generalized
singular value decomposition , Numer. Math. 46 (1985), 479-491.
Per Christian Hansen, IMM, 12/19/97.
Initialization. - CGSVD Compact generalized SVD of a matrix pair in regularization problems.
sm = cgsvd(A,L)
[U,sm,X,V] = cgsvd(A,L) , sm = [sigma,mu]
Computes the generalized SVD of the matrix pair (A,L):
[ A ] = [ U 0 ]*[ diag(sigma) 0 ]*inv(X)
[ L ] [ 0 V ] [ 0 eye(n-p) ]
[ diag(mu) 0 ]
where
U is m-by-n , sigma is p-by-1
V is p-by-p , mu is p-by-1
X is n-by-n .
It is assumed that m >= n >= p, which is true in regularization problems.
Reference: C. F. Van Loan, Computing the CS and the generalized
singular value decomposition , Numer. Math. 46 (1985), 479-491.
Per Christian Hansen, IMM, 12/19/97.
Initialization.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
cgsvd.m
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.