Consistency of subspace methods for signals with almost-periodic components
From MaRDI portal
Publication:445091
Recommendations
- On consistency of subspace methods for system identification
- Approximation of non-decaying signals from shift-invariant subspaces
- A Unified Theory of Union of Subspaces Representations for Period Estimation
- Nonstationary Consistency of Subspace Methods
- Subspace-based frequency estimation of sinusoidal signals in alpha-stable noise
- An Algorithm for Subspace Computation, with Applications in Signal Processing
- scientific article; zbMATH DE number 4092658
- Subspace based system identification with periodic excitation signals
- Consistency and relative efficiency of subspace methods
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 193126 (Why is no real title available?)
- scientific article; zbMATH DE number 926766 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3244325 (Why is no real title available?)
- Analysis of the asymptotic properties of the MOESP type of subspace algorithms
- Approximate linear realizations of given dimension via Ho's algorithm
- Asymptotic properties of subspace estimators
- Canonical correlation analysis, approximate covariance extension, and identification of stationary time series
- Consistency and relative efficiency of subspace methods
- On covariance function tests used in system identification
- On the ill-conditioning of subspace identification with inputs
- Spectral analysis of signals. The missing data case.
- Statistical analysis of novel subspace identification methods
- Subspace algorithms for the stochastic identification problem
Cited in
(3)
This page was built for publication: Consistency of subspace methods for signals with almost-periodic components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445091)