Asymptotic convergence analysis of the projection approximation subspace tracking algorithms

DOI10.1016/0165-1684(96)00008-4zbMath0875.94068OpenAlexW2094265461MaRDI QIDQ1352054

Bin Yang

Publication date: 27 February 1997

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1684(96)00008-4

zbMATH Keywords

Recursive estimationConvergence analysisArray signal processingSubspace methods

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (6)

Recursive 4SID algorithms using gradient type subspace tracking ⋮ Interference cancellation in GPS receiver using noise subspace tracking algorithm ⋮ Sparse constrained projection approximation subspace tracking ⋮ Recursive subspace identification of linear and nonlinear Wiener state-space models ⋮ Hierarchical gradient-based identification of multivariable discrete-time systems ⋮ Subspace clustering of high-dimensional data: a predictive approach

This page was built for publication: Asymptotic convergence analysis of the projection approximation subspace tracking algorithms