The paper provides a comparison between two relevant classes of numerical discretizations for stiff and nonstiff problems. Such a comparison regards linearly implicit Jacobian-dependent Runge–Kutta methods and fully implicit Runge–Kutta methods based on Gauss–Legendre nodes, both A-stable. We show that Jacobian-dependent discretizations are more efficient than Jacobian-free fully implicit methods, as visible in the numerical evidence.
Jacobian-dependent vs Jacobian-free discretizations for nonlinear differential problems
Conte Dajana;Pagano Giovanni;Paternoster Beatrice
2020-01-01
Abstract
The paper provides a comparison between two relevant classes of numerical discretizations for stiff and nonstiff problems. Such a comparison regards linearly implicit Jacobian-dependent Runge–Kutta methods and fully implicit Runge–Kutta methods based on Gauss–Legendre nodes, both A-stable. We show that Jacobian-dependent discretizations are more efficient than Jacobian-free fully implicit methods, as visible in the numerical evidence.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
