Skip to main navigation Skip to search Skip to main content

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

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

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 9 - Industry, Innovation, and Infrastructure
    SDG 9 Industry, Innovation, and Infrastructure

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