原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
ide by 0 is more involved. We begin by proving properties about certain submatrices of A.
Define the kth leading submatrix of A to be the matrix Ak consisting of the intersection of the first k rows and first k columns of A. Lemma 28.4 If A is a symmetric positive-definite matrix, then every leading submatrix of A is symmetric and positive-definite.
Proof Since A is symmetric, each leading submatrix Ak is also symmetric. We’ll prove that
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea