Linear Chebyshev approximation in the complex plane using Lawson’s algorithm

  • Ellacott S
  • Williams J
41Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Ellacott, S., & Williams, J. (1976). Linear Chebyshev approximation in the complex plane using Lawson’s algorithm. Mathematics of Computation, 30(133), 35–44. https://doi.org/10.1090/s0025-5718-1976-0400652-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free