An algorithm for complex linear approximation based on semi-infinite programming

Bernd Fischer*, Jan Modersitzki

*Corresponding author for this work
7 Citations (Scopus)

Abstract

An algorithm is described for computing the best linear Chebyshev approximation for functions in the complex plane. Implementation and convergence are shown and numerical examples are given.

Original languageEnglish
JournalNumerical Algorithms
Volume5
Issue number6
Pages (from-to)287-297
Number of pages11
ISSN1017-1398
DOIs
Publication statusPublished - 01.06.1993

Fingerprint

Dive into the research topics of 'An algorithm for complex linear approximation based on semi-infinite programming'. Together they form a unique fingerprint.

Cite this