<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-20T17:29:47Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/7968" metadataPrefix="marc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/7968</identifier><datestamp>2023-11-10T01:05:33Z</datestamp><setSpec>com_10259_6229</setSpec><setSpec>com_10259_4534</setSpec><setSpec>com_10259.4_106</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_6230</setSpec></header><metadata><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
<leader>00925njm 22002777a 4500</leader>
<datafield tag="042" ind1=" " ind2=" ">
<subfield code="a">dc</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Cano, Begoña</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Reguera López, Nuria</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2021-04</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">In previous papers, a technique has been suggested to avoid order reduction when integrating initial boundary value problems with several kinds of exponential methods. The technique&#xd;
implies in principle to calculate additional terms at each step from those already necessary without&#xd;
avoiding order reduction. The aim of the present paper is to explain the surprising result that,&#xd;
many times, in spite of having to calculate more terms at each step, the computational cost of doing&#xd;
it through Krylov methods decreases instead of increases. This is very interesting since, in that way,&#xd;
the methods improve not only in terms of accuracy, but also in terms of computational cost.</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">http://hdl.handle.net/10259/7968</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">10.3390/math9091008</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">2227-7390</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Avoiding order reduction</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Efficiency</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Krylov methods</subfield>
</datafield>
<datafield tag="245" ind1="0" ind2="0">
<subfield code="a">Why Improving the Accuracy of Exponential Integrators Can Decrease Their Computational Cost?</subfield>
</datafield>
</record></metadata></record></GetRecord></OAI-PMH>