原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
general, you substitute y1, y2, … , yi−1 “forward” into the ith equation to solve for yi:
Once you’ve solved for y, you can solve for x in equation (28.6) using back substitution, which is similar to forward substitution. This time, you solve the nth equation first and work backward to the first equation. Like forward substitution, this process
runs in Θ(n2) time. Since U is upper-triangular, the matrix equation Ux = y is equivalent
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea