VTechWorks staff will be away for the Thanksgiving holiday starting November 24 through November 28, and will not be replying to requests during this time. Thank you for your patience.

Show simple item record

dc.contributor.authorSandu, Adrianen
dc.contributor.authorGuenther, M.en
dc.date.accessioned2017-03-06T18:39:02Zen
dc.date.available2017-03-06T18:39:02Zen
dc.identifier.urihttp://hdl.handle.net/10919/75277en
dc.description.abstractThis work generalizes the additively partitioned Runge-Kutta methods by allowing for different stage values as arguments of different components of the right hand side. An order conditions theory is developed for the new family of generalized additive methods, and stability and monotonicity investigations are carried out. The paper discusses the construction and properties of implicit-explicit and implicit-implicit,methods in the new framework. The new family, named GARK, introduces additional flexibility when compared to traditional partitioned Runge-Kutta methods, and therefore offers additional opportunities for the development of flexible solvers for systems with multiple scales, or driven by multiple physical processes.en
dc.language.isoenen
dc.relation.urihttp://arxiv.org/abs/1310.5573v1en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectcs.NAen
dc.subjectcs.NAen
dc.subjectmath.NAen
dc.titleA class of generalized additive Runge-Kutta methodsen
dc.typeArticle - Refereeden
dc.contributor.departmentComputer Scienceen
pubs.organisational-group/Virginia Techen
pubs.organisational-group/Virginia Tech/All T&R Facultyen
pubs.organisational-group/Virginia Tech/Engineeringen
pubs.organisational-group/Virginia Tech/Engineering/COE T&R Facultyen
pubs.organisational-group/Virginia Tech/Engineering/Computer Scienceen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record