原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
has full column rank, then by Theorem D.6 on page 1222, ATA is positive-definite as well.
Hence, (ATA)−1 exists, and the solution to equation (28.21) is where the matrix A+ = ((ATA)−1AT) is the pseudoinverse of the matrix A. The pseudoinverse naturally generalizes the notion of a matrix inverse to the case in
which A is not square. (Compare equation (28.22) as the approximate solution to Ac = y wi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea