<?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-27T02:30:36Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/73254" metadataPrefix="etdms">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/73254</identifier><datestamp>2025-01-09T20:06:14Z</datestamp><setSpec>com_10324_1176</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_1359</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>Efficient exponential Rosenbrock methods till order four</title>
<creator>Cano Urdiales, Begoña</creator>
<creator>Moreta Santos, María Jesús</creator>
<description>Producción Científica</description>
<description>In a previous paper, a technique was described to avoid order reduction with exponential&#xd;
Rosenbrock methods when integrating initial boundary value problems with time-dependent&#xd;
boundary conditions. That requires to calculate some information on the boundary from the&#xd;
given data. In the present paper we prove that, under some assumptions on the coefficients&#xd;
of the method which are mainly always satisfied, no numerical differentiation is required to&#xd;
approximate that information in order to achieve order 4 for parabolic problems with Dirichlet&#xd;
boundary conditions. With Robin/Neumann ones, just numerical differentiation in time may be&#xd;
necessary for order 4, but none for order ≤ 3.&#xd;
Furthermore, as with this technique it is not necessary to impose any stiff order conditions,&#xd;
in search of efficiency, we recommend some methods of classical orders 2, 3 and 4 and we give&#xd;
some comparisons with several methods in the literature, with the corresponding stiff order.</description>
<date>2025-01-09</date>
<date>2025-01-09</date>
<date>2025</date>
<type>info:eu-repo/semantics/article</type>
<identifier>Journal of Computational and Applied Mathematics, enero 2025, vol. 453, 116158</identifier>
<identifier>0377-0427</identifier>
<identifier>https://uvadoc.uva.es/handle/10324/73254</identifier>
<identifier>10.1016/j.cam.2024.116158</identifier>
<identifier>116158</identifier>
<identifier>Journal of Computational and Applied Mathematics</identifier>
<identifier>453</identifier>
<language>eng</language>
<relation>https://www.sciencedirect.com/science/article/pii/S0377042724004072</relation>
<rights>info:eu-repo/semantics/openAccess</rights>
<rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</rights>
<rights>© 2024 The Author(s)</rights>
<rights>Attribution-NonCommercial-NoDerivatives 4.0 Internacional</rights>
<publisher>Elsevier</publisher>
</thesis></metadata></record></GetRecord></OAI-PMH>