Stability of the linear inequality method for rational Chebyshev approximation
type: Item
instance of: scholarly article
title: Stability of the linear inequality method for rational Chebyshev approximation
zbMATH Open document ID: 0579.65015
DOI: 10.1016/0377-0427(84)90016-5
author: Charles B. Dunham
published in: Journal of Computational and Applied Mathematics
publication date: 1984-01-01T00:00:00Z
review text: Given \(\epsilon\) \(\to 0\) and a function f, the author studies the problem of finding a rational function \(p_{\epsilon}/q_{\epsilon}\) of order (m,n) such that -\(\epsilon\) q(x)\(\leq f(x)q(x)-p(x)\leq \epsilon q(x)\). He proves a convergence theorem for \(\{p_{\epsilon}/q_{\epsilon}\}\) letting \(\epsilon\) to tend to the minimal admissible value.
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 41A20
Mathematics Subject Classification ID: 41A50
zbMATH DE Number: 3928184
zbMATH Keywords: rational Chebyshev approximation
zbMATH Keywords: discrete
zbMATH Keywords: linear inequality
zbMATH Keywords: method
reviewed by: Borislav D. Bojanov
MaRDI profile type: Publication
full work available at URL: 0377-0427(84)90016-5
OpenAlex ID: W2049302586
cites work: Q5543516
cites work: A Survey of Methods for Rational Approximation, with Particular Reference to a New Method Based on a Forumla of Darboux
cites work: Rational Chebyshev approximation on subsets
cites work: Stability of Differential Correction for Rational Chebyshev Approximation
cites work: A Comparison of Algorithms for Rational l ∞ Approximation
cites work: Algorithms for Chebyshev Approximations Using the Ratio of Linear Forms
cites work: Q5722348
cites work: Q5577758
cites work: On the conditioning of polynomial and rational forms
cites work: Minimal degree rational approximation
cites work: Q4871634
Wikidata QID: Q128028681
description: scientific article; zbMATH DE number 3928184