A new method for discrete least squares linearized rational approximation is presented. It generalizes the algorithm of Rutishauser-Gragg-Harrod-Reichel for discrete least squares polynomial approximation to the rational case. The algorithm is fast in the sense that it requires orderm? computation time wherem is the number of data points and ? is the degree of the approximant. We describe how this algorithm can be implemented in parallel.