Principal component analysis (PCA) has been a powerful tool for high-dimensional data analysis. It is usually redesigned to the incremental PCA algorithm for processing streaming data. In this paper, we propose a subspace type incremental two-dimensional PCA algorithm (SI2DPCA) derived from an incremental updating of the eigenspace to compute several principal eigenvectors at the same time for the online feature extraction. The algorithm overcomes the problem that the approximate eigenvectors extracted from the traditional incremental two-dimensional PCA algorithm (I2DPCA) are not mutually orthogonal, and it presents more efficiently. In numerical experiments, we compare the proposed SI2DPCA with the traditional I2DPCA in terms of the accuracy of computed approximations, orthogonality errors, and execution time based on widely used datasets, such as FERET, Yale, ORL, and so on, to confirm the superiority of SI2DPCA.
1 January 2025 in Numerical Algebra, Control & Optimization
An orthonormal basis matrix $ X $ of a subspace $ {\mathcal X} $ is known not to be unique, unless there are some kinds of normalization requirements. One of them is to require that $ X^{ \text{T}}D $ is positive semi-definite, where $ D $ is a constant matrix of apt size. It is a natural one in multi-view subspace learning models in which $ X $ serves as a projection matrix and is determined by a maximization problem over the Stiefel manifold whose objective function contains and increases with $ \text{tr}(X^{ \text{T}}D) $. This paper is concerned with bounding the change in orthonormal basis matrix $ X $ as subspace $ {\mathcal X} $ varies under the requirement that $ X^{ \text{T}}D $ stays positive semi-definite. The results are useful in convergence analysis of the NEPv approach (nonlinear eigenvalue problem with eigenvector dependency) to solve the maximization problem.
In the linear response eigenvalue problem arising from quantum chemistry and physics, one needs to compute several positive eigenvalues together with the corresponding eigenvectors. For such a task, in this paper, we present a FEAST algorithm based on complex contour integration for the linear response eigenvalue problem. By simply dividing the spectrum into a collection of disjoint regions, the algorithm is able to parallelize the process of solving the linear response eigenvalue problem. The associated convergence results are established to reveal the accuracy of the approximated eigenspace. Numerical examples are presented to demonstrate the effectiveness of our proposed algorithm.