<?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-05-05T21:00:36Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/28859" metadataPrefix="marc">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/28859</identifier><datestamp>2025-03-26T19:10:04Z</datestamp><setSpec>com_10324_1176</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_1359</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">Alamo Zapatero, Alfonso</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Sanz Serna, Jesús María</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2016</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">We present a technique, based on so-called word series, to write down in a systematic way expansions of the strong and weak local errors of splitting algorithms for the integration of Stratonovich stochastic differential equations. Those expansions immediately lead to the corresponding order conditions. Word series are similar to, but simpler than, the B-series used to analyze Runge--Kutta and other one-step integrators. The suggested approach makes it unnecessary to use the Baker--Campbell--Hausdorff formula. As an application, we compare two splitting algorithms recently considered by Leimkuhler and Matthews to integrate the Langevin equations. The word series method clearly bears out reasons for the advantages of one algorithm over the other.</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">SIAM J. Numer. Anal. 54-6 (2016), pp. 3239-3257</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">0036-1429</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">http://uvadoc.uva.es/handle/10324/28859</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">10.1137/16M1058765</subfield>
</datafield>
<datafield tag="245" ind1="0" ind2="0">
<subfield code="a">A technique for studying strong and weak local errors of splitting stochastic integrators</subfield>
</datafield>
</record></metadata></record></GetRecord></OAI-PMH>