Algebra of L-banded Matrices
Shunqi Huang, Lei Liu, and Brian M. Kurkoski

TL;DR
This paper explores the algebraic properties of L-banded matrices, a class of covariance matrices arising from optimized vector damping in iterative algorithms, providing explicit formulas and conditions for their key properties.
Contribution
It offers a comprehensive algebraic analysis of L-banded matrices, including explicit decompositions, determinants, and definiteness conditions, extending prior work on related matrix classes.
Findings
Derived explicit LDL and Cholesky decompositions.
Established conditions for matrix definiteness.
Provided formulas for determinants and inverses.
Abstract
Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an analytically optimized vector damping was proposed for memory message-passing (iterative) algorithms. As a result, it yields a special class of covariance matrices called L-banded matrices. In this paper, we show these matrices have broad algebraic properties arising from their L-banded structure. In particular, compact analytic expressions for the LDL decomposition, the Cholesky decomposition, the determinant after a column substitution, minors, and cofactors are derived. Furthermore, necessary and sufficient conditions for an L-banded matrix to be definite, a recurrence to obtain the characteristic polynomial, and some other properties are given. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Neural Networks and Applications · Advanced Optimization Algorithms Research
