使用eigne()求 矩阵的特征值Eigenvalues 和特征向量Eigenvectors |
您所在的位置：网站首页 › symmetrical怎么读音 › 使用eigne()求 矩阵的特征值Eigenvalues 和特征向量Eigenvectors |
| eigen函数参数如下 : > args(eigen)
function (x, symmetric, only.values = FALSE, EISPACK = FALSE)
NULL
其中，x参数输入矩阵；symmetric参数判断矩阵是否为对称矩阵，如果参数为空，系统将自动检测矩阵的对称性。例如： > A=matrix(1:9,nrow=3,ncol=3) > A [,1] [,2] [,3] [1,] 1 4 7 [2,] 2 5 8 [3,] 3 6 9eigen(A)得到一个list, 存储特征值和特征向量. > class(eigen(A)) [1] "list" > Aeigen=eigen(A) > Aeigen $values [1] 1.611684e+01 -1.116844e+00 -4.054214e-16 $vectors [,1] [,2] [,3] [1,] -0.4645473 -0.8829060 0.4082483 [2,] -0.5707955 -0.2395204 -0.8164966 [3,] -0.6770438 0.4038651 0.4082483 得到矩阵A的特征值：> Aeigen$values [1] 1.611684e+01 -1.116844e+00 -4.054214e-16得到矩阵A的特征向量： > Aeigen$vectors [,1] [,2] [,3] [1,] -0.4645473 -0.8829060 0.4082483 [2,] -0.5707955 -0.2395204 -0.8164966 [3,] -0.6770438 0.4038651 0.4082483 [参考] 1. http://student.zjzk.cn/course_ware/web-gcsx/main.htm 2. http://zh.wikipedia.org/zh-cn/%E7%89%B9%E5%BE%81%E5%90%91%E9%87%8F 3. http://www.zhihu.com/question/21874816 4. > help(eigen) eigen package:base R Documentation Spectral Decomposition of a Matrix Description: Computes eigenvalues and eigenvectors of numeric (double, integer, logical) or complex matrices. Usage: eigen(x, symmetric, only.values = FALSE, EISPACK = FALSE) Arguments: x: a numeric or complex matrix whose spectral decomposition is to be computed. Logical matrices are coerced to numeric. symmetric: if ‘TRUE’, the matrix is assumed to be symmetric (or Hermitian if complex) and only its lower triangle (diagonal included) is used. If ‘symmetric’ is not specified, the matrix is inspected for symmetry. only.values: if ‘TRUE’, only the eigenvalues are computed and returned, otherwise both eigenvalues and eigenvectors are returned. EISPACK: logical. Defunct and ignored. Details: If ‘symmetric’ is unspecified, the code attempts to determine if the matrix is symmetric up to plausible numerical inaccuracies. It is faster and surer to set the value yourself. Computing the eigenvectors is the slow part for large matrices. Computing the eigendecomposition of a matrix is subject to errors on a real-world computer: the definitive analysis is Wilkinson (1965). All you can hope for is a solution to a problem suitably close to ‘x’. So even though a real asymmetric ‘x’ may have an algebraic solution with repeated real eigenvalues, the computed solution may be of a similar matrix with complex conjugate pairs of eigenvalues. Value: The spectral decomposition of ‘x’ is returned as components of a list with components values: a vector containing the p eigenvalues of ‘x’, sorted in _decreasing_ order, according to ‘Mod(values)’ in the asymmetric case when they might be complex (even for real matrices). For real asymmetric matrices the vector will be complex only if complex conjugate pairs of eigenvalues are detected. vectors: either a p * p matrix whose columns contain the eigenvectors of ‘x’, or ‘NULL’ if ‘only.values’ is ‘TRUE’. The vectors are normalized to unit length. Recall that the eigenvectors are only defined up to a constant: even when the length is specified they are still only defined up to a scalar of modulus one (the sign for real matrices). If ‘r |
今日新闻 |
点击排行 |
|
推荐新闻 |
图片新闻 |
|
专题文章 |
| CopyRight 2018-2019 实验室设备网 版权所有 win10的实时保护怎么永久关闭 |