摘要
Finding the intersection of two subspaces is of great interest in many fields of signal processing. Over several decades,there have been numerous formulas discovered to solve this problem, among which the alternate projection method(APM) is the most popular one. However, APM suffers from high computational complexity, especially for real-time applications. Moreover, APM only gives the projection instead of the orthogonal basis of two given subspaces. This paper presents two alternate algorithms which have a closed form and reduced complexity as compared to the APM technique. Numerical simulations are conducted to verify the correctness and the effectiveness of the proposed methods.
Finding the intersection of two subspaces is of great interest in many fields of signal processing. Over several decades,there have been numerous formulas discovered to solve this problem, among which the alternate projection method(APM) is the most popular one. However, APM suffers from high computational complexity, especially for real-time applications. Moreover, APM only gives the projection instead of the orthogonal basis of two given subspaces. This paper presents two alternate algorithms which have a closed form and reduced complexity as compared to the APM technique. Numerical simulations are conducted to verify the correctness and the effectiveness of the proposed methods.
基金
supported by the National Natural Science Foundation of China(61501142
61871149)
the project supported by Discipline Construction Guiding Foundation in Harbin Institute of Technology(Weihai)(WH2-0160107)
