Subspace Pursuit Algorithm (SP) Package

This article introduces the Subspace Pursuit Algorithm (SP) package, which includes demonstration programs, the core SP algorithm implementation, and supplementary utilities. The package provides robust solutions for various computational problems in linear algebra and computational geometry through efficient matrix operations and vector space projections. The implementation features optimized orthogonal matching pursuit techniques with iterative subspace refinement, allowing users to handle sparse signal recovery and high-dimensional data processing with improved convergence rates. This comprehensive toolkit serves as a powerful resource that enhances workflow efficiency and productivity, enabling users to achieve superior results in their technical projects. The package offers an intuitive interface with well-documented code structure, featuring modular design with clear function separation (e.g., basis pursuit modules, residual calculation functions, and stopping criterion implementations) that allows quick understanding of component interactions and functionality, thereby maximizing utilization of the package's advanced capabilities.