原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
e 7 computed lik.) Because line 11 is triply nested, LU-DECOMPOSITION runs in Θ(n3) time.
Figure 28.1 illustrates the operation of LU-DECOMPOSITION. It shows a standard optimization of the procedure that stores the significant elements of L and U in place in the matrix A. Each element aij corresponds to either lij (if i > j) or uij (if i ≤ j),
so that the matrix A holds both L and U when the procedure terminates. To obtain the pseu
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea