Abstract
An algorithm is presented for the computation of the coefficients of least square fitting polynomials. The algorithm is such that multiplication is not required with respect to the data points. Since the only multiplication required is by system constants, and that only for the final computation, this algorithm is suitable for real time computation on small microprocessors. Explicit coefficients are given for the quadratic case.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
