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 language | English |
|---|---|
| Journal | Numerical Algorithms |
| Volume | 5 |
| Issue number | 6 |
| Pages (from-to) | 287-297 |
| Number of pages | 11 |
| ISSN | 1017-1398 |
| DOIs | |
| Publication status | Published - 01.06.1993 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver