这个系列文章是我重温Gilbert老爷子的线性代数在线课程的学习笔记。
Course Name:MIT 18.06 Linear Algebra
Text Book: Introduction to Linear Algebra
章节内容: 2.6
课程提纲
1. Factorization
A=LU
A
=
L
U
2. Explanation: why
A=LU
A
=
L
U
课程重点

Factorization A=LU A = L U
Many key ideas of linear algebra, when we look at them closely, are really factorizations of a matrix. The first and most important factorization in practice comes from elimination:
A=LU
A
=
L
U
, where factors
L
L
and are triangular matrices.
The entries of
L
L
are exactly the multipliers - which multiplied the pivot row
j
j
when it was subtracted from row :
A=LU
A
=
L
U
(
A=LDU
A
=
L
D
U
) is elimination without row exchanges. The upper triangular
U
U
has the pivots on its diagonal. The lower triangular has all 1’s on its diagonal. The multipliers are below the diagonal of
L
L
. If no row exchanges, each multiplier goes directly into its
i
i
, position into
L
L
.
Assume no row exchanges, when can we predict zeros in and
U
U
:
- When a row of starts with zeros, so does that row of L L .
- When a column of starts with zeros, so does that column of
U
U
.

Explanation: why
When computing row of
U
U
, we subtract multiples of earlier rows of (not rows of
A
A
!):
Rewrite this equation to see that the row is multiplying
U
U
:
This is exactly row 3 of . That row of
L
L
holds .
Better balance: Divide
U
U
by a diagonal matrix that contains the pivots:
The triangular factorization can be written
A=LU
A
=
L
U
or
A=LDU
A
=
L
D
U
.
本文是关于MIT 18.06线性代数课程的笔记,聚焦于矩阵A的LU分解。讲解了如何通过消除法得到下三角矩阵L和上三角矩阵U,以及在没有行交换的情况下,如何预测L和U中的零元素。还探讨了为何可以将矩阵A分解为L和U,并引入了通过包含主元的对角矩阵D来改进平衡的分解方式。
641

被折叠的 条评论
为什么被折叠?



