Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks
DOI10.1016/j.laa.2016.07.020zbMath1348.15009arXiv1408.0994OpenAlexW1655492871MaRDI QIDQ314752
Markus Püschel, François Serre
Publication date: 16 September 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.0994
algorithmSchur complementLU factorizationcircuit complexityblock matricesblock triangular decompositionrank minimization
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Unnamed Item
- Unnamed Item
- Manifestations of the Schur complement
- Permuting data with the Omega network
- Permuting streaming data using RAMs
- The Indirect Binary n-Cube Microprocessor Array
- Approximate Inverse Techniques for Block-Partitioned Matrices
- Stability of block LU factorization
- A Generalization of the Schur Complement by Means of the Moore–Penrose Inverse
This page was built for publication: Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks
