← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

28 第28章 矩阵运算

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

hat PA = LU. Using LUP-SOLVE, you can solve an equation of the form Ax = b in Θ(n2) time.

Since the LUP decomposition depends on A but not b, you can run LUP-SOLVE on a second set of equations of the form Ax = b′ in Θ(n2) additional time. In general, once you have the LUP decomposition of A, you can solve, in Θ(kn2) time, k versions of the

equation Ax = b that differ only in the vector b. Let’s think of the equation which defin

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea