官术网_书友最值得收藏!

Cholesky decomposition

As I'm sure you've figured out by now, there is more than one way to factorize a matrix, and there are special methods for special matrices.

The Cholesky decomposition is square root-like and works only on symmetric positive definite matrices. 

This works by factorizing A into the form LLT. Here, L, as before, is a lower triangular matrix.

Do develop some intuition. It looks like this:

However, here, L is called a Cholesky factor

Let's take a look at the case where .

We know from the preceding matrix that ; therefore, we have the following:

Let's multiply the upper and lower triangular matrices on the right, as follows:

Writing out A fully and equating it to our preceding matrix gives us the following:

We can then compare, element-wise, the corresponding entries of A and LLT and solve algebraically for as follows:

We can repeat this process for any symmetric positive definite matrix, and compute the li,j values given ai,j.

主站蜘蛛池模板: 丰城市| 台江县| 淮滨县| 焦作市| 桃园县| 云和县| 汶上县| 翼城县| 峨山| 登封市| 辽宁省| 洪洞县| 平舆县| 青岛市| 博客| 武隆县| 深州市| 鹿邑县| 仙游县| 德格县| 桓仁| 东阿县| 饶阳县| 常山县| 英超| 樟树市| 东宁县| 温州市| 上虞市| 开封市| 绥芬河市| 错那县| 札达县| 襄垣县| 翁牛特旗| 根河市| 太仓市| 乌拉特中旗| 万宁市| 申扎县| 独山县|