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

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.

主站蜘蛛池模板: 桐庐县| 长宁县| 闸北区| 松江区| 察隅县| 定日县| 炎陵县| 洛宁县| 阿鲁科尔沁旗| 杨浦区| 电白县| 林西县| 武山县| 湖南省| 红河县| 龙江县| 昭平县| 海淀区| 垦利县| 巴中市| 临汾市| 建德市| 班戈县| 灵石县| 高淳县| 长丰县| 贺州市| 南华县| 从化市| 灌阳县| 石首市| 大埔县| 洛川县| 元朗区| 和顺县| 阆中市| 喜德县| 左云县| 西乌珠穆沁旗| 潞城市| 曲松县|