← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

28 第28章 矩阵运算

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.752Z

. No further changes occur on the fourth (final) step. (j) The LUP decomposition PA = LU.

Because of its triply nested loop structure, LUP-DECOMPOSITION has a running time of Θ(n3), which is the same as that of LU-DECOMPOSITION. Thus, pivoting costs at most a constant factor in time. Exercises 28.1-1 Solve the equation by using forward substitution.

28.1-2 Find an LU decomposition of the matrix 28.1-3 Solve the equation by using an LUP d

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea