Can singular value decomposition be used for complex matrices?

  • Thread starter Cyrus
  • Start date
  • Tags
    Matrix
In summary, a positive-semi-definite matrix is a type of square matrix with all non-negative eigenvalues. It is commonly used in statistics, physics, and engineering for tasks such as representing covariance matrices and solving optimization problems. To determine if a matrix is positive-semi-definite, one can check if all eigenvalues are non-negative using methods such as Cholesky decomposition or the power method. Some properties of positive-semi-definite matrices include non-negative eigenvalues, non-negative determinant, symmetry, diagonalizability, and the ability to define inner products and distances in vector spaces.
  • #1
Cyrus
3,238
16
[tex]A*A^T[/tex]

Will result in a symmetric matrix. Does this mean that A*A^T will be positive semi-definite?


Does A have to be strictly real, can it be complex?
 
Physics news on Phys.org
  • #2
A*AT is symmetric IF A is real. For complex matrices you want to use the adjoint rather than the transpose.

The eigenvalues of A*A* are always real and non-negative. The square roots of these eigenvalues are called the singular values of A. Singular value decomposition is a very important matrix decomposition technique.
 

What is a positive-semi-definite matrix?

A positive-semi-definite matrix is a type of square matrix in which all of its eigenvalues are non-negative. This means that when the matrix is multiplied by any non-zero vector, the resulting vector will have a non-negative length.

What is the difference between positive-semi-definite and positive-definite matrices?

The main difference between positive-semi-definite and positive-definite matrices is that while all eigenvalues of a positive-semi-definite matrix are non-negative, a positive-definite matrix has all of its eigenvalues strictly greater than zero.

How can a positive-semi-definite matrix be used in real-world applications?

Positive-semi-definite matrices are commonly used in fields such as statistics, physics, and engineering. They can be used to represent covariance matrices, which are useful in analyzing data and making predictions. They are also used in optimization problems, such as finding the minimum of a function.

How can you determine if a matrix is positive-semi-definite?

To determine if a matrix is positive-semi-definite, you can check if all of its eigenvalues are non-negative. This can be done by finding the eigenvalues of the matrix using methods such as the Cholesky decomposition or the power method.

What are some properties of positive-semi-definite matrices?

Positive-semi-definite matrices have several important properties, including:

  • All eigenvalues are non-negative
  • The determinant is non-negative
  • The matrix is symmetric
  • The matrix is always diagonalizable
  • Positive-semi-definite matrices can be used to define inner products and distances in vector spaces

Similar threads

  • Linear and Abstract Algebra
Replies
1
Views
979
  • Linear and Abstract Algebra
Replies
1
Views
578
  • Linear and Abstract Algebra
Replies
6
Views
1K
Replies
7
Views
820
  • Linear and Abstract Algebra
Replies
2
Views
579
  • Linear and Abstract Algebra
Replies
9
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
929
  • Linear and Abstract Algebra
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
12
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
794
Back
Top