Skip to main content
SpringerLink
Log in

Determination of the algebraic polynomial of best approximation

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. E. Ya. Remez, General Computing Methods for the Chebyshev Approximation [in Russian], Izd-vo UkrSSR, Kiev, 1957.

    Google Scholar 

  2. E. Stiefel, Numerical Methods of Tchebycheff Approximation, Univ. Wisconsin Press, pp. 217–232, 1959.

  3. M. K. Kovalenko, “The approximate construction of polynomials of best approximation,” Usp. matem. nauk,28, no. 6, Moscow, 1963.

  4. M. I. Ageev, V. P. Alik, L. V. Malik, and Yu. I. Markov, Algorithms (51–100) [in Russian] Izd-vo VTs AN SSSR, 87–89, Moscow, 1966.

    Google Scholar 

  5. V. N. Burov, “Some effective methods for solving the Chebyshev problem of the best approximation,” Izvestiya VUZ. Matematika, no. 1, Moscow, 1957.

    Google Scholar 

  6. E. Ya. Remez, “The method of successive Chebyshev interpolations and different variants in its implementation,” Ukrainskii matematicheskii zhurnal,12, no. 2, Kiev, 1960.

Download references

Authors
  1. V. N. Malozemov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Leningrad State University. Translated from Kibernetika, Vol. 5, No. 5, pp. 125–131, September–October, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Malozemov, V.N. Determination of the algebraic polynomial of best approximation. Cybern Syst Anal 5, 676–682 (1969). https://doi.org/10.1007/BF01267894

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01267894

Keywords

Search

Navigation