An efficient implementation of the orthogonal least squares algorithm for subset model selection is derived. Computational complexity of the algorithm is examined and the result shows that this new fast orthogonal least squares algorithm significantly reduces computational requirements
Published in:
Signal Processing, IEEE Transactions on
(Volume:43
,
Issue:
7
)
Date of Publication: Jul 1995