← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

D 附录D 矩阵

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.801Z

ices that arise in applications are often positive-definite due to the following theorem.

Theorem D.6 For any matrix A with full column rank, the matrix ATA is positive-definite. Proof We must show that xT(ATA)x > 0 for any nonzero vector x. For any vector x, xT(A

TA)x = (Ax)T(Ax) (by Exercise D.1-2) = ∥Ax∥2. The value ∥Ax∥2 is just the sum of the squar

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix004.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea