Sbornik: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Sb.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sbornik: Mathematics, 2008, Volume 199, Issue 2, Pages 207–228
DOI: https://doi.org/10.1070/SM2008v199n02ABEH003916
(Mi sm3905)
 

This article is cited in 5 scientific papers (total in 5 papers)

Finding polynomials of best approximation with weight

V. I. Lebedevab

a Russian Research Centre "Kurchatov Institute"
b Institute of Numerical Mathematics, Russian Academy of Sciences
References:
Abstract: A new iterative method for finding the parameters of polynomials of best approximation with weight in $C[-1,1]$ is presented. It is based on the representation of the error in the trigonometric form in terms of the phase function. The iterative method of finding the corrections to the phase functions that determine the joint motion of the zeros and the $e$-points of the error is based on inverse analysis, perturbation theory, and asymptotic formulae for extremal polynomials.
Bibliography: 24 titles.
Received: 07.06.2007 and 06.11.2007
Russian version:
Matematicheskii Sbornik, 2008, Volume 199, Number 2, Pages 49–70
DOI: https://doi.org/10.4213/sm3905
Bibliographic databases:
UDC: 517.518.82
MSC: Primary 41A05, 41A10, 41A50; Secondary 65D05, 65D32
Language: English
Original paper language: Russian
Citation: V. I. Lebedev, “Finding polynomials of best approximation with weight”, Mat. Sb., 199:2 (2008), 49–70; Sb. Math., 199:2 (2008), 207–228
Citation in format AMSBIB
\Bibitem{Leb08}
\by V.~I.~Lebedev
\paper Finding polynomials of best approximation with weight
\jour Mat. Sb.
\yr 2008
\vol 199
\issue 2
\pages 49--70
\mathnet{http://mi.mathnet.ru/sm3905}
\crossref{https://doi.org/10.4213/sm3905}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2402198}
\zmath{https://zbmath.org/?q=an:1170.41300}
\elib{https://elibrary.ru/item.asp?id=20359303}
\transl
\jour Sb. Math.
\yr 2008
\vol 199
\issue 2
\pages 207--228
\crossref{https://doi.org/10.1070/SM2008v199n02ABEH003916}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000255696300009}
\elib{https://elibrary.ru/item.asp?id=13565448}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-44449162602}
Linking options:
  • https://www.mathnet.ru/eng/sm3905
  • https://doi.org/10.1070/SM2008v199n02ABEH003916
  • https://www.mathnet.ru/eng/sm/v199/i2/p49
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математический сборник Sbornik: Mathematics
    Statistics & downloads:
    Abstract page:687
    Russian version PDF:295
    English version PDF:7
    References:73
    First page:7
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024