Linear Chebyshev approximation in the complex plane using Lawson’s algorithm
HTML articles powered by AMS MathViewer
- by S. Ellacott and Jack Williams PDF
- Math. Comp. 30 (1976), 35-44 Request permission
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.References
- E. W. Cheney, Introduction to approximation theory, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1966. MR 0222517
- A. K. Cline, Rate of convergence of Lawson’s algorithm, Math. Comp. 26 (1972), 167–176. MR 298872, DOI 10.1090/S0025-5718-1972-0298872-8
- G. Golub, Numerical methods for solving linear least squares problems, Numer. Math. 7 (1965), 206–216. MR 181094, DOI 10.1007/BF01436075 C. L. LAWSON, Contributions to the Theory of Linear Least Maximum Approximations, Thesis, UCLA, 1961.
- G. G. Lorentz, Approximation of functions, Holt, Rinehart and Winston, New York-Chicago, Ill.-Toronto, Ont., 1966. MR 0213785
- John R. Rice, The approximation of functions. Vol. 2: Nonlinear and multivariate theory, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1969. MR 0244675
- John R. Rice and Karl H. Usow, The Lawson algorithm and extensions, Math. Comp. 22 (1968), 118–127. MR 232137, DOI 10.1090/S0025-5718-1968-0232137-4
- T. J. Rivlin and H. S. Shapiro, A unified approach to certain problems of approximation and minimization, J. Soc. Indust. Appl. Math. 9 (1961), 670–699. MR 133636, DOI 10.1137/0109056
- Jack Williams, Numerical Chebyshev approximation in the complex plane, SIAM J. Numer. Anal. 9 (1972), 638–649. MR 314232, DOI 10.1137/0709053
Additional Information
- © Copyright 1976 American Mathematical Society
- Journal: Math. Comp. 30 (1976), 35-44
- MSC: Primary 65D15
- DOI: https://doi.org/10.1090/S0025-5718-1976-0400652-0
- MathSciNet review: 0400652