Abstract
Principal component and minor component extractions provide powerful techniques in many information processing fields. There have been proposed a number of algorithms for principal and minor component (or subspace) extraction, which have different dynamical behaviors. In this paper, we give rigorous stability analysis of these algorithms, obtaining a unified insight view on the dynamical behaviors of various algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
