|| Checking for direct PDF access through Ovid
Fast, efficient and reliable algorithms for the discrete least-square approximation of scattered points on the torus Td and the sphere S2 by trigonometric polynomials are presented. The algorithms are based on iterative CG-type methods in combination with fast Fourier transforms for nonequispaced data. The emphasis is on numerical aspects, in order to solve large scale problems. Numerical examples show the efficiency of the new algorithms.