← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

28 第28章 矩阵运算

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

er n of unknowns. There are other possibilities, however, which merit a brief discussion.

If the number of equations is less than the number n of unknowns—or, more generally, if the rank of A is less than n—then the system is underdetermined. An underdetermined system typically has infinitely many solutions, although it may have no solutions at all if the equations are inconsistent. If the number of equations exceeds the number n of unknowns, the system is overdetermined, and there may not exist any solutions. Section 28.3 addresses the important problem of finding good

approximate solutions to overdetermined systems of linear equations. Let’s return to the

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea