Minimax polynomial approximation-Reference-Cited by-同舟云学术

Minimax polynomial approximation

Published:1966 Issue:94 Volume:20 Page:257-265
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Denman Harry H.

Abstract

Some new methods for obtaining the minimax polynomial approximation of degree n n to a continuous function are introduced, and applied to several simple functions. The amount of computation required is substantially reduced compared with that of previous methods.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1966-20-094/S0025-5718-1966-0195235-8/S0025-5718-1966-0195235-8.pdf

Reference6 articles.

1. Harry H. Denman, "Computer generation of optimized subroutines," J. Assoc. Comput. Mach., v. 8, 1961, pp. 104–116.

2. The process of equating maxima;Novodvorskiĭ, E. P.;Uspehi Matem. Nauk (N.S.),1951

3. Chebyshev approximation of a continuous function by a class of functions;Shenitzer, A.;J. Assoc. Comput. Mach.,1957

4. W. Fraser & J. F. Hart, "On the computation of rational approximations to continuous functions," Comm. ACM, v. 5, 1962, pp. 401–403.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Super-Gaussian BSS Using Fast-ICA with Chebyshev–Pade Approximant;Circuits, Systems, and Signal Processing;2017-04-11

2. An ECMA-55 Minimal BASIC Compiler for x86-64 Linux®;Computers;2014-10-01

3. A simple statistical method for catch comparison studies;Fisheries Research;2009-01