Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with matrix
Search options answers only
not deleted
user 28666
A matrix (plural matrices) is a rectangular array of numbers, symbols, or expressions arranged in rows and columns. The individual items in a matrix are called its elements or entries.
7
votes
Is every correlation matrix positive definite?
The answers by @yoki and @MarkLStone (+1 to both) both point out that a population correlation matrix can have zero eigenvalues if variables are linearly related (such as e.g. … See Why is a sample covariance matrix singular when sample size is less than number of variables? and Why is the rank of covariance matrix at most $n-1$? …
- 107k
3
votes
Ways to modify data minimally while the variables to follow the desired covariances
\:\:\mathbf Z^\top\mathbf Z = \mathbf I,$$ which is solved in Find a matrix with orthonormal columns with minimum Frobenius distance to the given matrix. …
- 107k
11
votes
Frobenius norm of a product of Gaussian matrices
Let $X$ be $d\times d$ a random matrix with iid $\mathcal N(0, 1/d)$ elements. …
- 107k
99
votes
Why the sudden fascination with tensors?
A usual $n\times p$ data matrix is an example of a 2D tensor according to this definition.
This is not how tensors are defined in mathematics and physics! … One example of a real tensor in statistics would be a covariance matrix. …
769
votes
Accepted
Relationship between SVD and PCA. How to use SVD to perform PCA?
It is a symmetric matrix and so it can be diagonalized: $$\mathbf C = \mathbf V \mathbf L \mathbf V^\top,$$ where $\mathbf V$ is a matrix of eigenvectors (each column is an eigenvector) and $\mathbf L$ … is a diagonal matrix with eigenvalues $\lambda_i$ in the decreasing order on the diagonal. …
- 107k