Algorithm and its performance analysis of principal singular subspace tracking

DOI10.7641/CTA.2020.90498MaRDI QIDQ5143010zbMATH OpenFDO

Authors Boyang Du, Xiangyu Kong, Xiaowei Feng

Publication date 14 January 2021

Full work available at URL https://doi.org/10.7641/CTA.2020.90498

zbMATH Keywords

convergence analysisneural networksprincipal singular subspaceself-stabilizing property

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On a class of orthonormal algorithms for principal and minor subspace tracking
• Analysis of a class of continuous-time algorithms for principal component analysis and subspace tracking
• A fast neural network algorithm for principal singular triplet extraction
• On principal subspace analysis
• Asymptotic convergence analysis of the projection approximation subspace tracking algorithms

Cited in

(3)

• An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking
• A fast neural network algorithm for principal singular triplet extraction
• Stable Subspace Tracking Algorithm Based on a Signed URV Decomposition

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Algorithm and its performance analysis of principal singular subspace tracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143010)