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

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.

主站蜘蛛池模板: 泗水县| 芜湖县| 沈丘县| 小金县| 驻马店市| 漠河县| 平罗县| 岗巴县| 云梦县| 大城县| 安西县| 衡南县| 青冈县| 冕宁县| 凤台县| 县级市| 清流县| 阿勒泰市| 元谋县| 南投县| 定远县| 思南县| 浑源县| 邛崃市| 塔城市| 凤城市| 南平市| 始兴县| 吴川市| 亚东县| 来宾市| 三江| 磴口县| 正阳县| 滦平县| 榆社县| 建宁县| 新密市| 汶上县| 辽宁省| 漳州市|