原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
tack the problem of computing the LUP decomposition itself. Forward and back substitution
Forward substitution can solve the lower-triangular system (28.5) in Θ(n2) time, given L, P, and b. An array π[1 : n] provides a more compact format to represent the permutation P than an n × n matrix that is mostly 0s. For i = 1, 2,
… , n, the entry π[i] indicates that Pi,π[i] = 1 and Pij = 0 for j ≠ π[i]. Thus, PA has a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea