Uncovering Surprising Properties of the Cholesky Decomposition

Click For Summary
SUMMARY

The discussion focuses on the properties of the Cholesky decomposition, specifically the relationship between matrices X=AB (where A is lower triangular) and Y=BA, which appears to be a positive definite matrix. The author explores the non-commutative nature of the product AB and discovers that the sequence of positive definite matrices generated from this relationship converges to a diagonal matrix. Numerical experiments indicate varying rates of convergence for matrices of the same dimension, suggesting a potential method for ranking matrices based on their convergence behavior.

PREREQUISITES
  • Understanding of Cholesky decomposition and its properties
  • Familiarity with positive definite matrices
  • Basic knowledge of matrix operations and non-commutativity
  • Experience with numerical methods and matrix convergence
NEXT STEPS
  • Investigate the properties of positive definite matrices in depth
  • Learn about the convergence behavior of matrix sequences
  • Explore numerical methods for matrix rank determination
  • Study the implications of non-commutative matrix products
USEFUL FOR

Mathematicians, data scientists, and researchers interested in linear algebra, particularly those focusing on matrix theory and numerical analysis.

amateur82
Messages
2
Reaction score
0
I noticed a funny thing. The Cholesky decomposition can be defined as X=AB, where A is lower triangular. Generally Y=BA is not X, but Y seems to be a positive definite matrix. I wonder if there is any special properties to the pair (X,Y). I know that a positive definite matrix can be interpreted as a metric. So a pair of conjugate metrics?

It is also funny that the product AB is not commutative. You would think so, since A=B'. So when you map by X, first you turn to direction B, and then to orthogonal direction. For some reason this seems to be completely different than turning first to orthogonal direction and then to direction B...

edit: played around more, and found out, that it's not actually a pair, but a sequence of positive definite matrices! chol(Y) doesn't involve A and B, but some other triangular matrices. So a map from psd matrix to another X -> Y -> Z... does anybody know where this sequence leads?
 
Last edited:
A diagonal matrix is trivially a fixed point of this process. (As for a diagonal matrix, A=B, and consequently, X=Y.) Numerical experiments show that all these sequences seem to converge to a diagonal matrix, yet the rate of convergence is different, even for matrices of same dimension. So perhaps this could be used as a 'grade' to rank matrices. For 2x2 matrices, the map is easy to give explicitly. If we denote an arbitrary member of sequence as X(t), we have

x(t+1)11 = x(t)11 + x(t)122 / x(t)11
x(t+1)12 = (x(t)12 / √x(t)11)√(x(t)22 - x(t)122 / x(t)11)
x(t+1)22 = x(t)11 - x(t)122 / x(t)11.

So the map contracts x(t+1)22 and increases x(t+1)11 uniformly, and maintains the sign of x(t+1)12. This wasn't true for off-diagonals of larger matrices, at least according to numerical trials. It would probably be easy to derive other properties for the Cholesky seqeunece in M(2x2); please feel free to try. I'm not expecting any major scientific breakthrough from here!
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
8K