An algorithm for the quadratic approximation
type: Item
instance of: scholarly article
title: An algorithm for the quadratic approximation
zbMATH Open document ID: 0558.41024
DOI: 10.1016/0377-0427(84)90018-9
author: S. L. Loi
author: A. W. McInnes
published in: Journal of Computational and Applied Mathematics
publication date: 1984-01-01T00:00:00Z
review text: Given f, the polynomials \(p\in \Pi_{\ell}\), \(q\in \Pi_ m\), \(r\in \Pi_ n\) are called a quadratic approximation, if \(pf^ 2+qf+r=O(x^{\ell +m+n+2})\). This concept generalizes Padé approximation. Similar recursion formulas for the polynomials are established. Specifically, an analogue of the Mühlbach-Neville-Aitken scheme is discussed. An algorithm in some symbolic language (father: probably FORTRAN, mother:ALGOL) is presented. Numerical results for \(e^ x\) and another function are given.
reviewed by: D. Braess
Mathematics Subject Classification ID: 41A30
Mathematics Subject Classification ID: 41A21
zbMATH DE Number: 3890080
zbMATH Keywords: algorithm
zbMATH Keywords: symbolic language
zbMATH Keywords: Numerical results
MaRDI profile type: Publication
full work available at URL: 0377-0427(84)90018-9
OpenAlex ID: W1968118762
cites work: Q4076249
cites work: The mühlbach-neville-aitken algorithm and some extensions
cites work: A general extrapolation algorithm
cites work: Q3868240
cites work: The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
cites work: An algorithm for generalized rational interpolation
cites work: Quadratic approximation and its application to acceleration of convergence
cites work: The general Neville-Aitken-algorithm and some applications
cites work: On Quadratic Approximation
description: scientific article; zbMATH DE number 3890080