Banded Matrix Fraction Representation of Triangular Input Normal Pairs
Andrew P. Mullhaupt, Kurt S. Riedel

TL;DR
This paper introduces a new banded matrix fraction representation for triangular input normal pairs, enabling efficient system updates and identification, especially when the matrix has real eigenvalues.
Contribution
It presents a novel system representation where the matrix is expressed as a low-bandwidth triangular matrix fraction, facilitating faster computations and explicit parameterization.
Findings
Efficient state update requires only 3n multiplications for real eigenvalues.
Provides explicit parameterization in terms of eigenvalues.
Enables fast system identification and updates.
Abstract
An input pair is triangular input normal if and only if is triangular and , where is theidentity matrix. Input normal pairs generate an orthonormal basis for the impulse response. Every input pair may be transformed to a triangular input normal pair. A new system representation is given: is triangular normal and is a matrix fraction, , where and are triangular matrices of low bandwidth. For single input pairs, and are bidiagonal and an explicit parameterization is given in terms of the eigenvalues of . This band fraction structure allows for fast updates of state space systems and fast system identification. When A has only real eigenvalues, one state advance requires multiplications for the single input case.
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
TopicsControl Systems and Identification · Numerical Methods and Algorithms · Matrix Theory and Algorithms
