<?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-21T03:12:49Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/7968" metadataPrefix="qdc">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><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
<dc:title>Why Improving the Accuracy of Exponential Integrators Can Decrease Their Computational Cost?</dc:title>
<dc:creator>Cano, Begoña</dc:creator>
<dc:creator>Reguera López, Nuria</dc:creator>
<dc:subject>Avoiding order reduction</dc:subject>
<dc:subject>Efficiency</dc:subject>
<dc:subject>Krylov methods</dc:subject>
<dcterms: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.</dcterms:abstract>
<dcterms:dateAccepted>2023-11-09T10:25:56Z</dcterms:dateAccepted>
<dcterms:available>2023-11-09T10:25:56Z</dcterms:available>
<dcterms:created>2023-11-09T10:25:56Z</dcterms:created>
<dcterms:issued>2021-04</dcterms:issued>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>http://hdl.handle.net/10259/7968</dc:identifier>
<dc:identifier>10.3390/math9091008</dc:identifier>
<dc:identifier>2227-7390</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>Mathematics. 2021, V. 9, n. 9, 1008</dc:relation>
<dc:relation>https://doi.org/10.3390/math9091008</dc:relation>
<dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>Atribución 4.0 Internacional</dc:rights>
<dc:publisher>MDPI</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>