Math 2.0

definition

Moore–Penrose inverse

Definition

Let AA be an m×nm \times n complex matrix. There is exactly one n×mn \times m complex matrix A+A^+ with these four properties:

  1. AA+A=AA A^+ A = A.
  2. A+AA+=A+A^+ A A^+ = A^+.
  3. (AA+)∗=AA+(A A^+)^* = A A^+.
  4. (A+A)∗=A+A(A^+ A)^* = A^+ A.

This matrix is the Moore–Penrose inverse, or pseudoinverse, of AA, where ∗^* is the conjugate transpose.

Remarks

If AA is invertible, then A+=A−1A^+ = A^{-1}. If the columns of AA are linearly independent, then A+=(A∗A)−1A∗A^+ = (A^* A)^{-1} A^*. For b∈Cmb \in \C^m, the vector A+bA^+ b is the least squares solution of Ax=bAx = b with the least norm. If A=UΣV∗A = U \Sigma V^* is a singular value decomposition, then A+=VΣ+U∗A^+ = V \Sigma^+ U^*, where Σ+\Sigma^+ inverts the nonzero singular values and transposes.

Explanations

L1 human

The pseudoinverse extends the inverse to all matrices, also singular and rectangular ones. It gives the best possible solution of Ax=bAx = b when no exact solution exists or when there are many. For the zero matrix, the pseudoinverse is the zero matrix of the transposed size.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Matrix definition
  2. Transpose definition
  3. Conjugate transpose definition
  4. Moore–Penrose inverse definition

Sources

  1. Web https://en.wikipedia.org/wiki/Moore–Penrose_inverse, Definition