Block matrix pseudoinverse - Alchetron, the free social encyclopedia

In mathematics, block matrix pseudoinverse is a formula of pseudoinverse of a partitioned matrix. This is useful for decomposing or approximating many algorithms updating parameters in signal processing, which are based on least squares method.

Derivation

Consider a column-wise partitioned matrix:

[ A , B ] , A ∈ R m × n , B ∈ R m × p , m ≥ n + p .

If the above matrix is full rank, the Moore–Penrose pseudoinverse matrices of it and its transpose are

[ A , B ] + = ( [ A , B ] T [ A , B ] ) − 1 [ A , B ] T , [ A T B T ] + = [ A , B ] ( [ A , B ] T [ A , B ] ) − 1 .

This computation of the pseudoinverse requires (n + p)-square matrix inversion and does not take advantage of the block form.

To reduce computational costs to n- and p-square matrix inversions and to introduce parallelism, treating the blocks separately, one derives

[ A , B ] + = [ P B ⊥ A ( A T P B ⊥ A ) − 1 P A ⊥ B ( B T P A ⊥ B ) − 1 ] = [ ( P B ⊥ A ) + ( P A ⊥ B ) + ] , [ A T B T ] + = [ P B ⊥ A ( A T P B ⊥ A ) − 1 , P A ⊥ B ( B T P A ⊥ B ) − 1 ] = [ ( A T P B ⊥ ) + , ( B T P A ⊥ ) + ] ,

where orthogonal projection matrices are defined by

The above formulas are not necessarily valid if [ A , B ] does not have full rank – for example, if A ≠ 0 , then

[ A , A ] + = 1 2 [ A + A + ] ≠ [ ( P A ⊥ A ) + ( P A ⊥ A ) + ] = 0

Application to least squares problems

Given the same matrices as above, we consider the following least squares problems, which appear as multiple objective optimizations or constrained problems in signal processing. Eventually, we can implement a parallel algorithm for least squares based on the following results.

Column-wise partitioning in over-determined least squares

Suppose a solution x = [ x 1 x 2 ] solves an over-determined system:

[ A , B ] [ x 1 x 2 ] = d , d ∈ R m × 1 .

Using the block matrix pseudoinverse, we have

x = [ A , B ] + d = [ ( P B ⊥ A ) + ( P A ⊥ B ) + ] d .

Therefore, we have a decomposed solution:

x 1 = ( P B ⊥ A ) + d , x 2 = ( P A ⊥ B ) + d .

Row-wise partitioning in under-determined least squares

[Comment re. below: According to section "Derivation" above this method of calculating [A, B]+ for m>=n+p. Can it then be used for an underdetermined system where by definition m (size of x and equal to number of variables) > n+p (number of equations)?]

Suppose a solution x solves an under-determined system:

[ A T B T ] x = [ e f ] , e ∈ R n × 1 , f ∈ R p × 1 .

The minimum-norm solution is given by

x = [ A T B T ] + [ e f ] .

Using the block matrix pseudoinverse, we have

x = [ ( A T P B ⊥ ) + , ( B T P A ⊥ ) + ] [ e f ] = ( A T P B ⊥ ) + e + ( B T P A ⊥ ) + f .

Comments on matrix inversion

Instead of ( [ A , B ] T [ A , B ] ) − 1 , we need to calculate directly or indirectly

( A T A ) − 1 , ( B T B ) − 1 , ( A T P B ⊥ A ) − 1 , ( B T P A ⊥ B ) − 1 .

In a dense and small system, we can use singular value decomposition, QR decomposition, or Cholesky decomposition to replace the matrix inversions with numerical routines. In a large system, we may employ iterative methods such as Krylov subspace methods.

Considering parallel algorithms, we can compute ( A T A ) − 1 and ( B T B ) − 1 in parallel. Then, we finish to compute ( A T P B ⊥ A ) − 1 and ( B T P A ⊥ B ) − 1 also in parallel.

References

Block matrix pseudoinverse Wikipedia

(Text) CC BY-SA