A matrix and its inverse: revisting minimal rank completions
Abstract
We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.