Publication:
Construction of additive semi-implicit Runge-Kutta methods with low-storage requirements

dc.contributor.authorHigueras Sanz, Inmaculada
dc.contributor.authorRoldán Marrodán, Teodoro
dc.contributor.departmentIngeniería Matemática e Informáticaes_ES
dc.contributor.departmentMatematika eta Informatika Ingeniaritzaeu
dc.date.accessioned2015-10-01T08:59:48Z
dc.date.available2017-06-01T23:00:11Z
dc.date.issued2016
dc.descriptionThe final publication is available at Springer via http://dx.doi.org/ 10.1007/s10915-015-0116-2en
dc.description.abstractSpace discretization of some time-dependent partial differential equations gives rise to systems of ordinary differential equations in additive form whose terms have different stiffness properties. In these cases, implicit methods should be used to integrate the stiff terms while efficient explicit methods can be used for the non-stiff part of the problem. However, for systems with a large number of equations, memory storage requirement is also an important issue. When the high dimension of the problem compromises the computer memory capacity, it is important to incorporate low memory usage to some other properties of the scheme. In this paper we consider Additive Semi-Implicit Runge-Kutta (ASIRK) methods, a class of implicitexplicit Runge-Kutta methods for additive differential systems. We construct two second order 3-stage ASIRK schemes with low-storage requirements. Having in mind problems with stiffness parameters, besides accuracy and stability properties, we also impose stiff accuracy conditions. The numerical experiments done show the advantages of the new methods.es_ES
dc.description.sponsorshipSupported by Ministerio de Economía y Competividad, project MTM2011-23203.en
dc.embargo.lift2017-06-01
dc.embargo.terms2017-06-01
dc.format.mimetypeapplication/pdfen
dc.identifier.doi10.1007/s10915-015-0116-2
dc.identifier.issn1573-7691 (Electronic)
dc.identifier.urihttps://academica-e.unavarra.es/handle/2454/18334
dc.language.isoengen
dc.publisherSpringer USen
dc.relation.ispartofJournal of Scientific Computing (2016) 67:1019–1042en
dc.relation.projectIDinfo:eu-repo/grantAgreement/MICINN//MTM2011-23203/ES/en
dc.relation.publisherversionhttps://dx.doi.org/10.1007/s10915-015-0116-2
dc.rights© Springer Science+Business Media New York 2015en
dc.rights.accessRightsAcceso abierto / Sarbide irekiaes
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen
dc.subjectAdditive Runge-Kutta methodsen
dc.subjectStrong stability preservingen
dc.subjectLow-storageen
dc.subjectStiff problemsen
dc.subjectTime discretization schemesen
dc.titleConstruction of additive semi-implicit Runge-Kutta methods with low-storage requirementsen
dc.typeArtículo / Artikuluaes
dc.typeinfo:eu-repo/semantics/articleen
dc.type.versionVersión aceptada / Onetsi den bertsioaes
dc.type.versioninfo:eu-repo/semantics/acceptedVersionen
dspace.entity.typePublication
relation.isAuthorOfPublication2bbd2efb-9302-4135-804e-38cb641598c7
relation.isAuthorOfPublication512f2308-1620-423f-aa53-8a9f81605091
relation.isAuthorOfPublication.latestForDiscovery2bbd2efb-9302-4135-804e-38cb641598c7

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
low_storage_arxiv.pdf
Size:
402.96 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.78 KB
Format:
Item-specific license agreed to upon submission
Description: