<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
<record>
  <controlfield tag="001">3269</controlfield>
  <datafield tag="037" ind1=" " ind2=" ">
    <subfield code="a">ART--2009-004</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Calvo, M. </subfield>
    <subfield code="b">calvo@unizar.es</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">On the solution of discontinuous IVPs by adaptive Runge-Kutta codes </subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2003</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">mult. p</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">In this paper an automatic technique for handling discontinuous IVPs when they are solved by means of adaptive Runge–Kutta codes is proposed. This technique detects, accurately locates and passes the discontinuities in the solution of IVPs by using the information generated by the code along the numerical integration together with a continuous interpolant of the discrete solution. A remarkable feature is that it does not require additional information on the location of the discontinuities. Some numerical experiments are presented to illustrate the reliability and efficiency of the proposed algorithms.</subfield>
  </datafield>
  <datafield tag="653" ind1="1" ind2=" ">
    <subfield code="a">discontinuous initial value problems</subfield>
  </datafield>
  <datafield tag="653" ind1="1" ind2=" ">
    <subfield code="a">adaptive Runge–Kutta methods</subfield>
  </datafield>
  <datafield tag="653" ind1="1" ind2=" ">
    <subfield code="a">detection of discontinuities</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Montijano, Juan I.</subfield>
    <subfield code="b">montijano@unizar.es</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Rández, Luis</subfield>
    <subfield code="b">randez@unizar.es</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="t">Numerical Algorithms</subfield>
    <subfield code="p">Numer. Algorithms</subfield>
    <subfield code="x">1572-9265</subfield>
    <subfield code="g">Vol. 33, Num. 1-4 (agosto de 2003), pp. 163-182</subfield>
  </datafield>
  <datafield tag="856" ind1="0" ind2=" ">
    <subfield code="f">teresa@unizar.es</subfield>
  </datafield>
  <datafield tag="910" ind1="2" ind2=" ">
    <subfield code="a"></subfield>
    <subfield code="b">Matemática Aplicada</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">ART</subfield>
    <subfield code="b">ANyA</subfield>
  </datafield>
  <datafield tag="983" ind1=" " ind2=" ">
    <subfield code="a">international_article</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zaguan.unizar.es:3269</subfield>
    <subfield code="p">driver</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="u">http://dx.doi.org/10.1023/A:1025507920426</subfield>
    <subfield code="z">Texto completo</subfield>
  </datafield>
</record>
</collection>
