原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
ion. For any z ≠ 0, we therefore have zTSz = xTAx > 0, and thus S is positive-definite. ▪
Corollary 28.6 LU decomposition of a symmetric positive-definite matrix never causes a division by 0. Proof Let A be an n × n symmetric positive-definite matrix. In fact, we’ll prove a stronger result than the statement of the corollary:
every pivot is strictly positive. The first pivot is a11. Let e1 be the length-n unit vec
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea