<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
    <record>
        <controlfield tag="001">76032</controlfield>
        <controlfield tag="005">20190709135453.0</controlfield>
        <datafield tag="024" ind1="7" ind2=" ">
            <subfield code="2">doi</subfield>
            <subfield code="a">10.1016/j.cam.2015.12.005</subfield>
        </datafield>
        <datafield tag="024" ind1="8" ind2=" ">
            <subfield code="2">sideral</subfield>
            <subfield code="a">98965</subfield>
        </datafield>
        <datafield tag="037" ind1=" " ind2=" ">
            <subfield code="a">ART-2017-98965</subfield>
        </datafield>
        <datafield tag="041" ind1=" " ind2=" ">
            <subfield code="a">eng</subfield>
        </datafield>
        <datafield tag="100" ind1=" " ind2=" ">
            <subfield code="a">Vigo-Aguiar, J.</subfield>
        </datafield>
        <datafield tag="245" ind1=" " ind2=" ">
            <subfield code="a">A first approach in solving initial-value problems in ODEs by elliptic fitting methods</subfield>
        </datafield>
        <datafield tag="260" ind1=" " ind2=" ">
            <subfield code="c">2017</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">Exponentially-fitted and trigonometrically-fitted methods have a long successful history in the solution of initial-value problems, but other functions might be considered in adapted methods. Specifically, this paper aims at the derivation of a new numerical scheme for approximating initial value problems of ordinary differential equations using elliptic functions. The example considered is the undamped Duffing equation where the forcing term is of autonomous type affected by a perturbation parameter. The new scheme is constructed by considering a suitable approximation to the theoretical solution based on elliptic functions. The proposed elliptic fitting procedure has been tested on a variety of problems, showing its good performance.</subfield>
        </datafield>
        <datafield tag="540" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
            <subfield code="a">by-nc-nd</subfield>
            <subfield code="u">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</subfield>
        </datafield>
        <datafield tag="590" ind1=" " ind2=" ">
            <subfield code="a">1.632</subfield>
            <subfield code="b">2017</subfield>
        </datafield>
        <datafield tag="591" ind1=" " ind2=" ">
            <subfield code="a">MATHEMATICS, APPLIED</subfield>
            <subfield code="b">49 / 252 = 0.194</subfield>
            <subfield code="c">2017</subfield>
            <subfield code="d">Q1</subfield>
            <subfield code="e">T1</subfield>
        </datafield>
        <datafield tag="592" ind1=" " ind2=" ">
            <subfield code="a">0.938</subfield>
            <subfield code="b">2017</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computational Mathematics</subfield>
            <subfield code="c">2017</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Applied Mathematics</subfield>
            <subfield code="c">2017</subfield>
            <subfield code="d">Q2</subfield>
        </datafield>
        <datafield tag="655" ind1=" " ind2="4">
            <subfield code="a">info:eu-repo/semantics/article</subfield>
            <subfield code="v">info:eu-repo/semantics/acceptedVersion</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Ramos, H.</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0003-1263-1996</subfield>
            <subfield code="a">Clavero, C.</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">Dpto. Matemática Aplicada</subfield>
            <subfield code="c">Área Matemática Aplicada</subfield>
        </datafield>
        <datafield tag="773" ind1=" " ind2=" ">
            <subfield code="g">318 (2017), 599-603</subfield>
            <subfield code="p">J. comput. appl. math.</subfield>
            <subfield code="t">Journal of Computational and Applied Mathematics</subfield>
            <subfield code="x">0377-0427</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">262781</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/76032/files/texto_completo.pdf</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">70283</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/76032/files/texto_completo.jpg?subformat=icon</subfield>
            <subfield code="x">icon</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="909" ind1="C" ind2="O">
            <subfield code="o">oai:zaguan.unizar.es:76032</subfield>
            <subfield code="p">articulos</subfield>
            <subfield code="p">driver</subfield>
        </datafield>
        <datafield tag="951" ind1=" " ind2=" ">
            <subfield code="a">2019-07-09-11:41:52</subfield>
        </datafield>
        <datafield tag="980" ind1=" " ind2=" ">
            <subfield code="a">ARTICLE</subfield>
        </datafield>
    </record>

    
</collection>