Title: An algorithm for fast polynomial approximation
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.
Publication Year: 1987
Publication Date: 1987-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot