原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
lement, say ak1, from somewhere in the first column to the (1, 1) position of the matrix.
For the greatest numerical stability, LUP decomposition chooses the element in the first column with the greatest absolute value as ak1. (The first column cannot contain only 0s, for then A would be singular, because its determinant would be 0, by Theorems D.4 and
D.5 on page 1221.) In order to preserve the set of equations, LUP decomposition exchanges
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea