• Corpus ID: 2683372

# Orthogonal Representations for Output System Pairs

@article{Mullhaupt2018OrthogonalRF,
title={Orthogonal Representations for Output System Pairs},
author={Andrew P. Mullhaupt and Kurt S. Riedel},
journal={ArXiv},
year={2018},
volume={abs/1803.06571}
}
• Published 17 March 2018
• Computer Science, Mathematics, Engineering
• ArXiv
A new class of canonical forms is given proposed in which $(A, C)$ is in Hessenberg observer or Schur form and output normal: $\bf{I} - A^*A =C^*C$. Here, $C$ is the $d \times n$ measurement matrix and $A$ is the advance matrix. The $(C, A)$ stack is expressed as the product of $n$ orthogonal matrices, each of which depends on $d$ parameters. State updates require only ${\cal O}(nd)$ operations and derivatives of the system with respect to the parameters are fast and convenient to compute…

## References

SHOWING 1-10 OF 29 REFERENCES
Banded matrix fraction representation of triangular input normal pairs
• Mathematics, Computer Science
IEEE Trans. Autom. Control.
• 2001
A new band fraction structure allows for fast updates of state space systems and fast system identification when A has only real eigenvalues, when one state advance requires 3n multiplications for the single input case.
Hessenberg and Hessenberg/triangular forms in linear system thcory†
• Mathematics
• 1986
Abstract In this paper we distinguish between free Hessenberg forms, where only the system matrix is transformed into a special structure, and system Hessenberg forms, where either an input or output
A state-space approach to orthogonal digital filters
An algorithm for designing multi-input multi-output (MIMO) orthogonal digital filters is developed using a state-space approach. The algorithm consists of three parts: (i) orthogonal embedding, (ii)
A State-Space Approach to Orthogonal Digital Filters
embedded orthogonal transition matrix to the a-ertended upper Hessenberg form, and (iii) factorization of this new form into Givens (planar) rotations. Appropriately interconnecting the rotors leads
Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms
• Mathematics
• 1987
An algorithm is presented in this paper for computing state-space balancing transformations directly from a state-space realization. The algorithm requires no "squaring up" or unnecessary matrix
Low grade matrices and matrix fraction representations
• Mathematics
• 2002
Abstract The lower grade (lgrade) of an n × n matrix A is the largest rank of any subdiagonal block of a symmetric partition of A . A number of algebraic results on lgrade are given. When A has
Condensed forms for efficient time-invariant Kalman filtering
• Mathematics
• 1988
In this paper, new numerical implementations are developed for several “classical” types of Kalman filters. These implementations are based on the choice of an initial state transformation which
Matrix analysis
• Computer Science, Mathematics
• 1985
This new edition of the acclaimed text presents results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrates their importance in a variety of applications.
Constructing a Unitary Hessenberg Matrix from Spectral Data
• Mathematics
• 1991
We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an inverse QR algorithm. Any upper unitary Hessenberg matrix H with nonnegative subdiagonal elements can
Low Grade Matrices and Matrix Fraction
The matrix equation MA = N is considered. The lgrade of a matrix A is the the largest rank of any subdiagonal block of a symmetric partition of a square matrix. When A has lgrade d, representation