原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
= WTY, which equals B−1CTS−1CB−1. Set R = B−1 + Z. Set T = −YT. Set U = −Y. Set V = S−1.
Thus, to invert an n×n symmetric positive-definite matrix, invert two n/2×n/2 matrices in steps 2 and 5; perform four multiplications of n/2 × n/2 matrices in steps 3, 4, 6, and 7; plus incur an additional cost of O(n2)
for extracting submatrices from A, inserting submatrices into A−1, and performing a const
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea