<?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:03Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/7968" metadataPrefix="etdms">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><thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.0/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>Why Improving the Accuracy of Exponential Integrators Can Decrease Their Computational Cost?</title>
<creator>Cano, Begoña</creator>
<creator>Reguera López, Nuria</creator>
<subject>Avoiding order reduction</subject>
<subject>Efficiency</subject>
<subject>Krylov methods</subject>
<description>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.</description>
<date>2023-11-09</date>
<date>2023-11-09</date>
<date>2021-04</date>
<type>info:eu-repo/semantics/article</type>
<identifier>http://hdl.handle.net/10259/7968</identifier>
<identifier>10.3390/math9091008</identifier>
<identifier>2227-7390</identifier>
<language>eng</language>
<relation>Mathematics. 2021, V. 9, n. 9, 1008</relation>
<relation>https://doi.org/10.3390/math9091008</relation>
<rights>http://creativecommons.org/licenses/by/4.0/</rights>
<rights>info:eu-repo/semantics/openAccess</rights>
<rights>Atribución 4.0 Internacional</rights>
<publisher>MDPI</publisher>
</thesis></metadata></record></GetRecord></OAI-PMH>