Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks

DOI10.1016/J.LAA.2016.07.020MaRDI QIDQ314752zbMATHOpenAlexFDO

Authors François Serre, Markus Püschel

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

zbMATH Keywords

algorithmSchur complementcircuit complexityLU factorizationblock matricesblock triangular decompositionrank minimization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23) Vector spaces, linear dependence, rank, lineability (15A03)

Abstract: We propose a novel factorization of a non-singular matrix $P$, viewed as a $2imes2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower block-unitriangular, respectively. Our goal is to make this factorization "as block-diagonal as possible" by minimizing the ranks of the off-diagonal blocks. We give lower bounds on these ranks and show that they are sharp by providing an algorithm that computes an optimal solution. The proposed decomposition can be viewed as a generalization of the well-known Block LU factorization using the Schur complement.

Recommendations

• Customizable triangular factorizations of matrices
• Rank revealing \(LU\) factorizations
• Strong rank revealing LU factorizations
• Stability of block LU factorization for block tridiagonal block H-matrices
• LU factorization with panel rank revealing pivoting and its communication avoiding version

Cites work

• scientific article; zbMATH DE number 1682655 (Why is no real title available?)
• scientific article; zbMATH DE number 1111784 (Why is no real title available?)
• A Generalization of the Schur Complement by Means of the Moore–Penrose Inverse
• Approximate Inverse Techniques for Block-Partitioned Matrices
• Manifestations of the Schur complement
• Permuting data with the Omega network
• Permuting streaming data using RAMs
• Stability of block LU factorization
• The Indirect Binary n-Cube Microprocessor Array

Cited in

(1)

• Conjectured \textit{DXZ} decompositions of a unitary matrix

This page was built for publication: Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314752)