An algorithm for the construction of best approximations based on Kolmogorov's criterion
type: Item
instance of: scholarly article
title: An algorithm for the construction of best approximations based on Kolmogorov's criterion
zbMATH Open document ID: 0417.41012
DOI: 10.1016/0021-9045(78)90082-5
author: Gerhard Opfer
published in: Journal of Approximation Theory
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 41A50
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 30E10
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 3649351
zbMATH Keywords: Kolmogorov criterion
zbMATH Keywords: descent algorithm
zbMATH Keywords: best Chebyshev approximations
zbMATH Keywords: Chebyshev polynomials
zbMATH Keywords: complex approximations
MaRDI profile type: Publication
full work available at URL: 0021-9045(78)90082-5
OpenAlex ID: W2071703311
cites work: Q5683197
cites work: Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
cites work: Rational Chebyshev Approximation in the Complex Plane
cites work: Some Chebyshev approximations by polynomials in two variables
cites work: Complex Chebyshev polynomials on circular sectors
cites work: Q4403629
cites work: Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems
cites work: Q4057460
cites work: Monotone Approximation by Algebraic Polynomials
cites work: Some remarks on uniform asymptotic expansions for Bessel functions
cites work: Über die Approximation asymptotischer Entwicklungen. I
cites work: Q5531436
cites work: Q4063709
cites work: Some new characterizations of the Chebyshev polynomials
cites work: Q4042072
cites work: Q5549176
description: scientific article; zbMATH DE number 3649351