SIAM Review · 2004 · 50 citations · 17 references
Natural SciencesMathematicsAlgebraAlgorithmsRepresentation TheoryLinear AlgebraMatrix ComputationMatrix FactorizationMatrix StructureMatrix SystemsNumerical Linear AlgebraBoundary Element ModelingLow-rank ApproximationLow-rank Matrix FactorizationMatrix MultiplicationRank ConditionSparse Linear AlgebraSparse Matrix AlgorithmsSparse Matrix Computation
A banded invertible matrix T has a remarkable inverse. All "upper" and "lower" submatrices of T-1 have low rank (depending on the bandwidth in T). The exact rank condition is known, and it allows fast multiplication by full matrices that arise in the boundary element method. We look for the "right" proof of this property of T-1 . Ultimately it reduces to a fact that deserves to be better known: Complementary submatrices of any T and T-1 have the same nullity. The last figure in the paper (when T is tridiagonal) shows that, on and above the diagonal of T-1 , all rows are proportional.
17
AN INTRODUCTION TO LINEAR ALGEBRA
B. M. Wise, Neal B. Gallagher · Critical Reviews in Analytical Chemistry · 1998 · 236 citations
Mosaic-Skeleton approximations
CALCOLO · 1996 · 223 citations
Semi On-Line Scheduling on Two Identical Machines
Yong He, Guochuan Zhang · Computing · 1999 · 149 citations