Efficient Implementation of Diagonally Implicit Runge-Kutta Methods for Model Predictive Control

In direct shooting methods for nonlinear optimal control, one of the major computational costs is simulation of the system and calculation of sensitivities. These costs are particularly steep when the stiffness of the controlled system prescribes the use of implicit integrators, amongst which, implicit Runge-Kutta schemes are most popular. These methods require the use of Newton's method to solve a moderately sized system of nonlinear equations with a dense Jacobian, the computation of which grows cubically with the number of stages, that is, the number of abscissa. To mitigate this we investigate the use of the family of Diagonally Implicit Runge-Kutta (DIRK) methods whose Butcher tableaux are lower triangular. We describe the structure exploiting linear algebra required to make the DIRK methods competitive with fully implicit methods, including efficient sensitivity calculations. Finally, we evaluate the performance of DIRK methods on several example systems, and show that the efficient implementation yields Pareto optimal integration schemes. The fixed step size integrators are provided as part of the acados package and use high-performance linear algebra provided by BLASFEO.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24033
Primary Topic
Numerical Solvers for Ordinary Differential Equations
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Efficient Implementation of Diagonally Implicit Runge-Kutta Methods for Model Predictive Control

Jonathan Frey, Katrin Baumgärtner, Moritz Diehl, Anton Pozharskiy et al.
arXiv (Cornell University)
Numerical Solvers for Ordinary Differential Equations
preprint

Efficient Implementation of Diagonally Implicit Runge-Kutta Methods for Model Predictive Control

Jonathan Frey, Katrin Baumgärtner, Moritz Diehl, Anton Pozharskiy, Armin Nurkanović
preprint en

Abstract

In direct shooting methods for nonlinear optimal control, one of the major computational costs is simulation of the system and calculation of sensitivities. These costs are particularly steep when the stiffness of the controlled system prescribes the use of implicit integrators, amongst which, implicit Runge-Kutta schemes are most popular. These methods require the use of Newton's method to solve a moderately sized system of nonlinear equations with a dense Jacobian, the computation of which grows cubically with the number of stages, that is, the number of abscissa. To mitigate this we investigate the use of the family of Diagonally Implicit Runge-Kutta (DIRK) methods whose Butcher tableaux are lower triangular. We describe the structure exploiting linear algebra required to make the DIRK methods competitive with fully implicit methods, including efficient sensitivity calculations. Finally, we evaluate the performance of DIRK methods on several example systems, and show that the efficient implementation yields Pareto optimal integration schemes. The fixed step size integrators are provided as part of the acados package and use high-performance linear algebra provided by BLASFEO.

arXiv (Cornell University)
Numerical Solvers for Ordinary Differential Equations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon