[HTML][HTML] Application of approximate matrix factorization to high order linearly implicit Runge–Kutta methods
Abstract Linearly implicit Runge–Kutta methods with approximate matrix factorization can
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
[PDF][PDF] Computer Science Technical Report CSTR-14-10 August 19, 2014
H Zhang, A Sandu, P Tranquilli - arXiv preprint arXiv:1408.3622, 2014 - Citeseer
Abstract Linearly implicit Runge-Kutta methods with approximate matrix factorization can
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
[PDF][PDF] Application of approximate matrix factorization to high order linearly implicit Runge-Kutta methods
H Zhang, A Sandu, P Tranquilli - 2015 - vtechworks.lib.vt.edu
Abstract Linearly implicit Runge-Kutta methods with approximate matrix factorization can
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
Application of approximate matrix factorization to high order linearly implicit Runge-Kutta methods
H Zhang, A Sandu, P Tranquilli - arXiv preprint arXiv:1408.3622, 2014 - arxiv.org
Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve
efficiently large systems of differential equations that have a stiff linear part, eg reaction …
efficiently large systems of differential equations that have a stiff linear part, eg reaction …
Application of approximate matrix factorization to high order linearly implicit Runge–Kutta methods
H Zhang, A Sandu, P Tranquilli - Journal of computational and …, 2015 - dialnet.unirioja.es
Resumen Linearly implicit Runge–Kutta methods with approximate matrix factorization can
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
Application of approximate matrix factorization to high order linearly implicit Runge-Kutta methods
H Zhang, A Sandu, P Tranquilli - Journal of Computational and Applied …, 2015 - dl.acm.org
Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve
efficiently large systems of differential equations that have a stiff linear part, eg reaction …
efficiently large systems of differential equations that have a stiff linear part, eg reaction …
Application of approximate matrix factorization to high order linearly implicit Runge-Kutta methods
H Zhang, A Sandu, P Tranquilli - arXiv e-prints, 2014 - ui.adsabs.harvard.edu
Abstract Linearly implicit Runge-Kutta methods with approximate matrix factorization can
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
[PDF][PDF] Computer Science Technical Report CSTR-14-10 August 19, 2014
H Zhang, A Sandu, P Tranquilli - arXiv preprint arXiv …, 2014 - vtechworks.lib.vt.edu
Abstract Linearly implicit Runge-Kutta methods with approximate matrix factorization can
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …
solve efficiently large systems of differential equations that have a stiff linear part, eg reaction …