<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
    <record>
        <controlfield tag="001">71043</controlfield>
        <controlfield tag="005">20180625152915.0</controlfield>
        <datafield tag="024" ind1="7" ind2=" ">
            <subfield code="2">doi</subfield>
            <subfield code="a">10.1137/120864581</subfield>
        </datafield>
        <datafield tag="024" ind1="8" ind2=" ">
            <subfield code="2">sideral</subfield>
            <subfield code="a">82204</subfield>
        </datafield>
        <datafield tag="037" ind1=" " ind2=" ">
            <subfield code="a">ART-2013-82204</subfield>
        </datafield>
        <datafield tag="041" ind1=" " ind2=" ">
            <subfield code="a">eng</subfield>
        </datafield>
        <datafield tag="100" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-8089-343X</subfield>
            <subfield code="a">Barrio, Roberto</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="245" ind1=" " ind2=" ">
            <subfield code="a">A General Condition Number for Polynomials</subfield>
        </datafield>
        <datafield tag="260" ind1=" " ind2=" ">
            <subfield code="c">2013</subfield>
        </datafield>
        <datafield tag="506" ind1="0" ind2=" ">
            <subfield code="a">Access copy available to the general public</subfield>
            <subfield code="f">Unrestricted</subfield>
        </datafield>
        <datafield tag="520" ind1="3" ind2=" ">
            <subfield code="a">This paper presents a generic condition number for polynomials that is useful for polynomial evaluation of a finite series of polynomial basis defined by means of a linear recurrence. This expression extends the classical one for the power and Bernstein bases, but it also provides us a general framework for all the families of orthogonal polynomials like Chebyshev, Legendre, Gegenbauer, Jacobi, and Sobolev orthogonal polynomial bases. The standard algorithm for the evaluation of finite series in any of these polynomial bases is the extended Clenshaw algorithm. The use of this new condition number permits us to give a general theorem about the forward error for that evaluation algorithm. A running-error bound of the extended algorithm is also presented and all the bounds are compared in several numerical examples.</subfield>
        </datafield>
        <datafield tag="536" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/grantAgreement/ES/MICINN/MTM2009-10767</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/MICINN/MTM2012-31883</subfield>
        </datafield>
        <datafield tag="540" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
            <subfield code="a">by</subfield>
            <subfield code="u">http://creativecommons.org/licenses/by/3.0/es/</subfield>
        </datafield>
        <datafield tag="590" ind1=" " ind2=" ">
            <subfield code="a">1.69</subfield>
            <subfield code="b">2013</subfield>
        </datafield>
        <datafield tag="591" ind1=" " ind2=" ">
            <subfield code="a">MATHEMATICS, APPLIED</subfield>
            <subfield code="b">27 / 251 = 0.108</subfield>
            <subfield code="c">2013</subfield>
            <subfield code="d">Q1</subfield>
            <subfield code="e">T1</subfield>
        </datafield>
        <datafield tag="655" ind1=" " ind2="4">
            <subfield code="a">info:eu-repo/semantics/article</subfield>
            <subfield code="v">info:eu-repo/semantics/publishedVersion</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Jiang, Hao</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-5701-1670</subfield>
            <subfield code="a">Serrano, Sergio</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="710" ind1="2" ind2=" ">
            <subfield code="1">2005</subfield>
            <subfield code="2">595</subfield>
            <subfield code="a">Universidad de Zaragoza</subfield>
            <subfield code="b">Departamento de Matemática Aplicada</subfield>
            <subfield code="c">Matemática Aplicada</subfield>
        </datafield>
        <datafield tag="773" ind1=" " ind2=" ">
            <subfield code="g">51, 2 (2013), 1280-1294</subfield>
            <subfield code="p">SIAM j. numer. anal.</subfield>
            <subfield code="t">SIAM JOURNAL ON NUMERICAL ANALYSIS</subfield>
            <subfield code="x">0036-1429</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">674002</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/71043/files/texto_completo.pdf</subfield>
            <subfield code="y">Versión publicada</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">80848</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/71043/files/texto_completo.jpg?subformat=icon</subfield>
            <subfield code="x">icon</subfield>
            <subfield code="y">Versión publicada</subfield>
        </datafield>
        <datafield tag="909" ind1="C" ind2="O">
            <subfield code="o">oai:zaguan.unizar.es:71043</subfield>
            <subfield code="p">articulos</subfield>
            <subfield code="p">driver</subfield>
        </datafield>
        <datafield tag="951" ind1=" " ind2=" ">
            <subfield code="a">2018-06-25-13:54:57</subfield>
        </datafield>
        <datafield tag="980" ind1=" " ind2=" ">
            <subfield code="a">ARTICLE</subfield>
        </datafield>
    </record>

    
</collection>