<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Bos, Len</dc:creator>
  <dc:creator>De Marchi, Stefano</dc:creator>
  <dc:creator>Hormann, Kai</dc:creator>
  <dc:date>2011</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="de">It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a  promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational  interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results show that the Lebesgue  constant behaves similarly for interpolation at Chebyshev as well as logarithmically distributed nodes.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://susi.usi.ch/global/documents/318246</dc:identifier>
  <dc:identifier>https://localhost:5000/ark:/12658/srd1318246</dc:identifier>
  <dc:identifier>https://susi.usi.ch/documents/318246/files/ITR1101.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/ark/12658/srd1318246</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns1="xml" ns1:lang="en">On the Lebesgue constant of Berrut’s rational interpolant at equidistant nodes</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_816b</dc:type>
</oai_dc:dc>
