<?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:30:29Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/7968" metadataPrefix="mods">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><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:namePart>Cano, Begoña</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Reguera López, Nuria</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2023-11-09T10:25:56Z</mods:dateAvailable>
</mods:extension>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2023-11-09T10:25:56Z</mods:dateAccessioned>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2021-04</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="uri">http://hdl.handle.net/10259/7968</mods:identifier>
<mods:identifier type="doi">10.3390/math9091008</mods:identifier>
<mods:identifier type="essn">2227-7390</mods:identifier>
<mods:abstract>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.</mods:abstract>
<mods:language>
<mods:languageTerm>eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">http://creativecommons.org/licenses/by/4.0/</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">info:eu-repo/semantics/openAccess</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">Atribución 4.0 Internacional</mods:accessCondition>
<mods:subject>
<mods:topic>Avoiding order reduction</mods:topic>
</mods:subject>
<mods:subject>
<mods:topic>Efficiency</mods:topic>
</mods:subject>
<mods:subject>
<mods:topic>Krylov methods</mods:topic>
</mods:subject>
<mods:titleInfo>
<mods:title>Why Improving the Accuracy of Exponential Integrators Can Decrease Their Computational Cost?</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/article</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>