65F30 Other matrix algorithms
Refine
Language
- English (3)
Keywords
- BVD pencil (1)
- Cayley transformation (1)
- DAEs (1)
- ODEs (1)
- POD (1)
- VARMA(1,1) model (1)
- disk function method (1)
- even pencil (1)
- first order eigenvalue perturbation theory (1)
- model reduction (1)
- optimal control (1)
- palindromic eigenvalue problem (1)
- parameter estimation (1)
- pencil arithmetic (1)
- regularization (1)
- structured doubling algorithm (1)
- symplectic pencil (1)
Enforcing solvability of a nonlinear matrix equation and estimation of multivariate ARMA time series
(2013)
The matrix equation $X+AX^{-1}A^T=B$, arising in parameter estimation of certain time series models,
is solvable only for certain values of the matrices $A,B$.
We present a numerical method to modify $A,B$ in order to make the matrix equation solvable.
Since solvability depends on the location of the eigenvalues of the palindromic matrix polynomial $\lambda^2 A+\lambda B+A^T$,
our method works by moving those eigenvalues to specified locations using first order spectral perturbation theory.
The method is heuristic but works in practice, as is supported by several compelling numerical examples.
These examples arise from parameter estimation of a common time series model, the multivariate ARMA(1,1).
We propose a generalization of the Structured Doubling Algorithm (SDA) to compute invariant subspaces
of structured matrix pencils
that arise in the context of solving linear quadratic optimal control problems.
The new algorithm is
designed to attain better accuracy when the classical Riccati equation approach for the solution of the optimal control problem is not well suited because
the stable and unstable invariant subspaces are not well separated (due to eigenvalues near or on the imaginary
axis) or in the case when the Riccati solution does not exist at all. We analyze the convergence
of the method and compare the new method with the classical SDA algorithm as well as some recent structured QR-methods.
We review some known results for POD model reduction applied to ODEs. Then, these
results are generalized to several types of DAEs. We provide algorithms for the
model reduction and error bounds for the reduced order models. Some limits of
the approach are pointed out and alternative methods for reduced order subspace approximation
are presented. The POD approach is tested and evaluated for a medium sized DAE example
from multibody dynamics.