原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
and has the further advantage of being faster in practice. Overview of LUP decomposition
The idea behind LUP decomposition is to find three n × n matrices L, U, and P such that where L is a unit lower-triangular matrix, U is an upper-triangular matrix, and P is a permutation matrix. We call matrices L, U, and P satisfying equation (28.4) an LUP decomposition of the matrix
A. We’ll show that every nonsingular matrix A possesses such a decomposition. Computing a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea