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
Type of content
UC permalink
Publisher's DOI/URI
Thesis discipline
Degree name
Research Report
Publisher
University of Canterbury. Mathematics
Journal Title
Journal ISSN
Volume Title
Language
Date
1991
Authors
Balakrishnan, Easwaran
McInnes, A.W.
Abstract
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.
Description
Citation
Keywords
quadratic function approximation, computational algorithms, recursive algorithms
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Fields of Research::49 - Mathematical sciences::4904 - Pure mathematics::490401 - Algebra and number theory
Rights
Copyright Easwaran Balakrishnan