An efficient order recursive algorithm with a lattice structure for estimating continuous-time AR process parameters
The paper is devoted to the normal equation in estimating continuous-time AR process parameters. An order recursive algorithm is proposed which requires \(O(M^2)\) computations, where \(M\) is the order of the AR process, and therefore is computationally efficient. It is similar to the Levinson-type algorithm of Pham and Le Breton. The proposed algorithm however, has a new associated lattice structure. As a consequence, it has a new stability property for continuous time systems. This can be viewed as a continuous time pendant that is recursive-in-order to the well-known discrete-time version. The discrete-time approximation, when sampled-data are given, and connections with other algorithms are also discussed.
- A definiteness test for Hankel matrices and their lower submatrices
- A Levinson-type algorithm for modeling fast-sampled data
- All optimal Hankel-norm approximations of linear multivariable systems and theirL,∞-error bounds†
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Efficient solution of linear systems of equations with recursive structure
- Fast projection methods for minimal design problems in linear system theory
- Fast time-invariant implementations of Gaussian signal detectors
- scientific article; zbMATH DE number 3815428 (Why is no real title available?)
- scientific article; zbMATH DE number 3775748 (Why is no real title available?)
- scientific article; zbMATH DE number 193741 (Why is no real title available?)
- scientific article; zbMATH DE number 3542355 (Why is no real title available?)
- scientific article; zbMATH DE number 3219899 (Why is no real title available?)
- scientific article; zbMATH DE number 3225380 (Why is no real title available?)
- Interrelations between continuous and discrete lattice filter structures
- Introduction to stochastic control theory
- Levinson-Durbin-type algorithms for continuous-time autoregressive models and applications
- Modeling of Continuous Stochastic Processes from Discrete Observations with Application to Sunspots Data
- On a generalized Szegö- Levinson realization algorithm for optimal linear predictors based on a network synthesis approach
- On covariance function tests used in system identification
- On the stability of a general polynomial in the space of Markov parameters
This page was built for publication: An efficient order recursive algorithm with a lattice structure for estimating continuous-time AR process parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356129)