The performance of available methods for computing the polynomial coefficients of the quadratic function approximation is evaluated. By comparing the numerical results to those obtained by symbolic methods, for a variety of functions, the direct solution of the matrix equation and a variety of recursive algorithms are all shown to be numerically unstable. AMS classification

Balakrishnan, EaswaranMcInnes, A.W.2015-08-192015-08-191991http://hdl.handle.net/10092/10797The performance of available methods for computing the polynomial coefficients of the quadratic function approximation is evaluated. By comparing the numerical results to those obtained by symbolic methods, for a variety of functions, the direct solution of the matrix equation and a variety of recursive algorithms are all shown to be numerically unstable.enCopyright Easwaran Balakrishnanquadratic function approximationcomputational algorithmsrecursive algorithmsThe performance of available methods for computing the polynomial coefficients of the quadratic function approximation is evaluated. By comparing the numerical results to those obtained by symbolic methods, for a variety of functions, the direct solution of the matrix equation and a variety of recursive algorithms are all shown to be numerically unstable. AMS classificationFields of Research::49 - Mathematical sciences::4904 - Pure mathematics::490401 - Algebra and number theory