  In this paper we propose a new approach to least squares approximation
problems. This approach is based on partitioning and Schur function. The nature
of this approach is combinatorial, while most existing approaches are based on
algebra and algebraic geometry. This problem has several practical
applications. One of them is curve clustering. We use this application to
illustrate the results.
