Consistency and relative efficiency of subspace methods
Some identification procedures for linear stochastic systems are analyzed and compared. The systems are assumed to be stable. Strictly, minimum phase and having a known order. The first algorithm was proposed by Akaike (1976), the second one was presented by Larimore (1983). The algorithms use different schemes of state estimation but after that preliminary stage, the system matrices are computed by ordinary least-squares in both cases. The authors show that the matrices estimates are strongly consistent. The third algorithm under consideration was given by Hannan, Risanen, Astrom and Mayne (1982) and it is a variant of the iterative least-squares procedure. It is shown that the first algorithm and the third one are asymptotically equivalent. A relative efficiency of the second algorithm was analyzed by a Monte Carlo simulation. The results suggest that it is asymptotically efficient too and it can be recommended practically as the most numerically simple scheme.
- Statistical analysis of novel subspace identification methods
- Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs
- On consistency of subspace methods for system identification
- Consistency analysis of subspace identification methods based on a linear regression approach
- Subspace algorithms for the stochastic identification problem
- A new algorithm for recursive estimation of parameters in controlled ARMA processes
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 193126 (Why is no real title available?)
- Identification of echelon canonical forms for vector linear processes using least squares
- Markovian Representation of Stochastic Processes by Canonical Variables
- Multivariate linear time series models
- Recursive estimation of mixed autoregressive-moving average order
- Stochastic theory of minimal realization
- Structure and order estimation of multivariable stochastic processes
- Subspace algorithms for the stochastic identification problem
- Estimating ARMAX systems for multivariate time series using the state approach to subspace algorithms
- Subspace estimation and prediction methods for hidden Markov models
- On consistency of subspace methods for system identification
- Consistency and asymptotic normality of some subspace algorithms for systems without observed inputs
- The relation of the CCA subspace method to a balanced reduction of an autoregressive model.
- Consistency analysis of subspace identification methods based on a linear regression approach
- Comparison and integration of subspaces from a biplot perspective
- Some facts about the choice of the weighting matrices in Larimore type of subspace algorithms
- Asymptotic properties of subspace estimators
- Subspace algorithms for the stochastic identification problem
- Estimating cointegrated systems using subspace algorithms
- Dual time-frequency domain system identification
- Analysis of the asymptotic properties of the MOESP type of subspace algorithms
- Business cycle analysis and VARMA models
- Model specification and selection for multivariate time series
- Subspace-based fault detection robust to changes in the noise covariances
- Subspace-based continuous-time identification of fractional order systems from non-uniformly sampled data
- Vector autoregressive moving average identification for macroeconomic modeling: a new methodology
- Multivariate AR systems and mixed frequency data: G-identifiability and estimation
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- Fast estimation methods for time-series models in state–space form
- USING SUBSPACE METHODS FOR ESTIMATING ARMA MODELS FOR MULTIVARIATE TIME SERIES WITH CONDITIONALLY HETEROSKEDASTIC INNOVATIONS
- Consistency of subspace methods for signals with almost-periodic components
- Consistency and convergence rate for nearest subspace classifier
- Optimal bounds on the speed of subspace evolution*
- Nonstationary Consistency of Subspace Methods
- Criteria for informative experiments with subspace identification
- State-space analysis of Granger-Geweke causality measures with application to fMRI
- Comparing the CCA Subspace Method to Pseudo Maximum Likelihood Methods in the case of No Exogenous Inputs
- Forecasting linear dynamical systems using subspace methods
- ESTIMATING LINEAR DYNAMICAL SYSTEMS USING SUBSPACE METHODS
- Subspace identification for non-linear systems with measured-input non-linearities
- Subspace identification – a Markov parameter approach
- Bootstrap-based estimates of uncertainty in subspace identification methods
- Least-squares estimation of input/output models for distributed linear systems in the presence of noise
- Order estimation for subspace methods
- Efficient reservoir history matching using subspace vectors
- Identification of canonical models for vectors of time series: a subspace approach
- Statistical analysis of novel subspace identification methods
- Guaranteed stability with subspace methods
- Non-asymptotic error analysis of subspace identification for deterministic systems
- Finite sample analysis of subspace identification for autonomous stochastic systems
This page was built for publication: Consistency and relative efficiency of subspace methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1911279)
