原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
The trick, then, is to reduce the problem of inverting A to the problem of inverting ATA.
The reduction is based on the observation that when A is an n × n nonsingular matrix, we have A−1 = (ATA)−1AT, since ((ATA)−1AT)A = (ATA)−1(ATA) = In and a matrix inverse is unique. Therefore, to compute A−1, first multiply AT by A to
obtain ATA, then invert the symmetric positive-definite matrix ATA using the above divide
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea