GraphMath

Inverse & Pseudoinverse (A⁻¹ & A⁺)

From inverse to pseudoinverse: reversing the reachable part of a transformation

This chapter begins with the ordinary inverse in the square full-rank case and then extends the idea to tall, wide and rank-deficient matrices. The pseudoinverse explains how a transformation can be reversed on the part that remains reachable while respecting the geometry of row space, column space, null space and left null space.

Chapter contents

The chapter is available as a PDF. Page links below are best-effort: most browsers support them but some viewers may ignore the page hint.

Topic Pages
Simplest case: square full-rank A 1
Tall full-column-rank A 2–3
Wide full-row-rank A 3–5
General case: neither full column rank nor full row rank 5–6
A & A⁺ as bridge between ℝ² & ℝ³ 7–8

Was this chapter helpful?

Quick feedback helps us improve the site.