<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
<record>
  <controlfield tag="001">168466</controlfield>
  <controlfield tag="005">20260205155159.0</controlfield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="2">doi</subfield>
    <subfield code="a">10.1007/s10915-026-03184-0</subfield>
  </datafield>
  <datafield tag="024" ind1="8" ind2=" ">
    <subfield code="2">sideral</subfield>
    <subfield code="a">147905</subfield>
  </datafield>
  <datafield tag="037" ind1=" " ind2=" ">
    <subfield code="a">ART-2026-147905</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Conte, Dajana</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">General Runge–Kutta TASE Methods for Reaction–Diffusion Problems</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2026</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">The class of Time Accurate and highly Stable Explicit Runge–Kutta (RK–TASE) methods has been introduced by Bassenne, Fu and Mani (J. Comput. Phys. 2021) and then extended by Calvo, Montijano and Rández (J. Comput. Phys. 2021), and Aceto, Conte and Pagano (Appl. Numer. Math. 2024), for the efficient solution of stiff initial value problems. With the aim of making RK–TASE methods suitable for the efficient solution of semi–discretized reaction–diffusion Partial Differential Equations (PDEs), in this work we exploit a general formulation of the schemes that allows to reduce both their computational cost and error constants, obtaining also good stability properties for such problems. In particular, a thorough study of the accuracy and stability properties leads to new RK–TASE methods up to order five that are more efficient than existing ones. Several experiments show that the new proposed RK–TASE methods are able to efficiently solve models of PDEs from applications that require integration over long time intervals. Furthermore, they show the better performance of the new RK–TASE compared to other numerical schemes from the scientific literature.</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="536" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/grantAgreement/ES/MICINN/PID2022-141385NB-I00</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
    <subfield code="a">by</subfield>
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/deed.es</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">Montijano, Juan Ignacio</subfield>
    <subfield code="0">(orcid)0000-0001-6120-4427</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Pagano, Giovanni</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Paternoster, Beatrice</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Rández, Luis</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0002-4238-3228</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">106 (2026), 57 [32 pp.]</subfield>
    <subfield code="p">J. sci. comput.</subfield>
    <subfield code="t">Journal of Scientific Computing</subfield>
    <subfield code="x">0885-7474</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">1868676</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/168466/files/texto_completo.pdf</subfield>
    <subfield code="y">Versión publicada</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">1239443</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/168466/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:168466</subfield>
    <subfield code="p">articulos</subfield>
    <subfield code="p">driver</subfield>
  </datafield>
  <datafield tag="951" ind1=" " ind2=" ">
    <subfield code="a">2026-02-05-14:37:08</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">ARTICLE</subfield>
  </datafield>
</record>
</collection>