I have a symmetric, block tridiagonal matrix $A$. I am interested in computing the Cholesky decomposition of $A^{-1}$ (that is, I want to compute $R$, where $A^{-1}=RR^T$). I know how to compute the blocks of the inverse efficiently using an iterative algorithm. However, is there an efficient algorithm for computing the Cholesky factors $R$ directly (rather than first computing the inverse, and then performing the Cholesky decomposition)?
[Math] Efficient computation of Cholesky decomposition during tridiagonal matrix inverse
cholesky decompositionmatricesmatrix decompositionnumerical linear algebra
Best Answer
Here is my matlab code
$A=LL^T$