Some Results on Vandermonde Matrices with an Application to Time Series Analysis

@article{Klein2003SomeRO,
  title={Some Results on Vandermonde Matrices with an Application to Time Series Analysis},
  author={Andr{\'e} Klein and Peter Spreij},
  journal={SIAM J. Matrix Anal. Appl.},
  year={2003},
  volume={25},
  pages={213-223}
}
  • A. KleinP. Spreij
  • Published 2003
  • Mathematics, Computer Science
  • SIAM J. Matrix Anal. Appl.
In this paper we study Stein equations in which the coefficient matrices are in companion form. Solutions to such equations are relatively easy to compute as soon as one knows how to invert a Vandermonde matrix (in the generic case where all eigenvalues have multiplicity one) or a confluent Vandermonde matrix (in the general case). As an application we present a way to compute the Fisher information matrix of an autoregressive moving average (ARMA) process. The computation is based on the fact… 

Recursive Solution of Certain Structured Linear Systems

We provide explicit representations of the null space $\mathcal{S}$ of adjoints of companion-related matrices and of certain rectangular generalized Vandermonde matrices of block Toeplitz type which

On Stein’s equation, Vandermonde matrices and Fisher’s information matrix of time series processes. Part II: The ARMAX process

An approach is presented to get interconnections between the Fisher information matrix of an ARMAX process and a corresponding solution of a Stein equation. The case of algebraic multiplicity greater

UvA-DARE ( Digital Academic Repository ) Recursive solution of certain structured linear systems

We provide explicit representations of the null space S of adjoints of companionrelated matrices and of certain rectangular generalized Vandermonde matrices of block Toeplitz type which are

The Bezoutian, state space realizations and Fisher’s information matrix of an ARMA process

A Note on the Information Matrix for Multiplicative Seasonal Autoregressive Moving‐Average Models

Abstract.  It is shown that there is an invariance property for each of the elements of the information matrix of a multiplicative seasonal autoregressive moving‐average time‐series model, which

Block Vandermonde Matrices of Matrix Polynomial’s Solvents

Some properties of these matrices, and iterative algorithms to compute the determinant and the inverse of a block Vandermonde matrix are given, and a parallelization of these algorithms is presented.

Extreme Points of the Vandermonde Determinant on the Sphere and Some Limits Involving the Generalized Vandermonde Determinant

The values of the determinant of Vandermonde matrices with real elements are analyzed both visually and analytically over the unit sphere in various dimensions. For three dimensions some generalized

Positivities of Vandermonde tensors

The positivities of Vandermonde tensors are investigated, including their positive definiteness and total positivity, and it is shown that a VandermondE tensor generated by a positive increasing ordered vector is totally positive.

References

SHOWING 1-10 OF 20 REFERENCES

Computation of the Fisher information matrix for SISO models

Closed form expressions and an algorithm for obtaining the Fisher information matrix of Gaussian single input single output (SISO) time series models are presented. It enables the computation of the

Some notes on the inversion of confluent Vandermonde matrices

The determination of the inverse of the confluent Vandermonde matrix stood often in the focus of attention. To achieve this aim many methods were elaborated. Based on the Leibniz rule of derivation,

Computation of the exact information matrix of Gaussian time series with stationary random components

The paper presents an algorithm for efficient recursive computation of the Fisher information matrix of Gaussian time series whose random components are stationary, and whose means and covariances

The Fast Generalized Parker-Traub Algorithm for Inversion of Vandermonde and Related Matrices

The results of numerical experiments suggest that the Parker variant of what the authors shall call the Parker?Traub algorithm allows one not onlyfastO(n2) inversion of a Vandermonde matrix, but it also gives more accuracy.

The inversion of the Vandermonde matrix and transformation to the Jordan canonical form

Simple analytical relations are given for the inverse of the Vandermonde matrix as well as for the inverse of its confluent form. These relations, when used according to a suggested procedures allow

The Theory of Matrices

  • L. Mirsky
  • Mathematics
    The Mathematical Gazette
  • 1961
In the last two decades Soviet m athem aticians have produced a series of rem arkable books, whose common feature is the stress laid on thoroughness and intelligibility ra the r than on slickness of

The inverse of the generalized vandermonde matrix through the partial fraction expansion

A simple method for finding the inverse Vandermonde matrix is presented. The technique involves determination of the partial fraction expansion of rational functions. Only synthetic division and

Algebraic Riccati equations

1. Preliminaries from the theory of matrices 2. Indefinite scalar products 3. Skew-symmetric scalar products 4. Matrix theory and control 5. Linear matrix equations 6. Rational matrix functions 7.