Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1976Publisher:JSTORJournal:Mathematics of Computation, volume 30, page 35 (issn: 0025-5718,

Copyright policy )

Authors: Ellacott, S.; Williams, Jack;

doi: 10.2307/2005427 , 10.1090/s0025-5718-1976-0400652-0

Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm

- Summary
- Subjects
- Metrics

Abstract

In this paper we discuss the application of Lawson’s algorithm for computing best linear Chebyshev approximations to complex-valued functions. Some numerical examples are also presented.

Related Organizations

University of Manchester
United Kingdom

Keywords

Best approximation, Chebyshev systems, General theory of numerical methods in complex analysis (potential theory, etc.), Algorithms for approximation of functions, Approximation in the complex plane

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	16
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average