LIRK-W: Linearly-implicit Runge-Kutta methods with approximate matrix factorization
| dc.contributor.author | Tranquilli, Paul | en |
| dc.contributor.author | Sandu, Adrian | en |
| dc.contributor.author | Zhang, H. | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2017-03-06T18:30:27Z | en |
| dc.date.available | 2017-03-06T18:30:27Z | en |
| dc.date.issued | 2016-11-22 | en |
| dc.description.abstract | This paper develops a new class of linearly implicit time integration schemes called Linearly-Implicit Runge-Kutta-W (LIRK-W) methods. These schemes are based on an implicit-explicit approach which does not require a splitting of the right hand side and allow for arbitrary, time dependent, and stage varying approximations of the linear systems appearing in the method. Several formulations of LIRK-W schemes, each designed for specific approximation types, and their associated order condition theories are presented. | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.uri | http://hdl.handle.net/10919/75258 | en |
| dc.language.iso | en | en |
| dc.relation.uri | http://arxiv.org/abs/1611.07013v1 | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | math.NA | en |
| dc.title | LIRK-W: Linearly-implicit Runge-Kutta methods with approximate matrix factorization | 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 |