Fast subspace tracking algorithm based on the constrained projection approximation

DOI10.1155/2009/576972zbMath1184.94188DBLPjournals/ejasp/ValizadehK09OpenAlexW2044688039WikidataQ59248979 ScholiaQ59248979MaRDI QIDQ965295

Amir Valizadeh, Mahmood Karimi

Publication date: 24 April 2010

Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2009/576972

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Detection theory in information and communication theory (94A13)

Related Items (2)

Sparse constrained projection approximation subspace tracking ⋮ Sparse partial least squares regression for on‐line variable selection with multivariate data streams

Cites Work

• Rank-one modification of the symmetric eigenproblem
• A Singular Value Decomposition Updating Algorithm for Subspace Tracking
• Fast algorithms for updating signal subspaces
• Sliding Window Adaptive SVD Algorithms
• Fast approximated power iteration subspace tracking

This page was built for publication: Fast subspace tracking algorithm based on the constrained projection approximation