A class of generalized additive Runge-Kutta methods
| dc.contributor.author | Sandu, Adrian | en |
| dc.contributor.author | Guenther, Michael | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2017-03-06T18:39:02Z | en |
| dc.date.available | 2017-03-06T18:39:02Z | en |
| dc.date.issued | 2013-10-22 | en |
| dc.description.abstract | This 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.identifier.uri | http://hdl.handle.net/10919/75277 | en |
| dc.language.iso | en | en |
| dc.relation.uri | http://arxiv.org/abs/1310.5573v1 | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | cs.NA | en |
| dc.subject | math.NA | en |
| dc.title | A class of generalized additive Runge-Kutta methods | en |
| dc.type | Article - Refereed | en |
| dc.type.dcmitype | Text | en |
| pubs.organisational-group | /Virginia Tech | en |
| pubs.organisational-group | /Virginia Tech/All T&R Faculty | en |
| pubs.organisational-group | /Virginia Tech/Engineering | en |
| pubs.organisational-group | /Virginia Tech/Engineering/COE T&R Faculty | en |
| pubs.organisational-group | /Virginia Tech/Engineering/Computer Science | en |