Sensitivity approximation by the Peano-Baker series

Abstract In this paper we develop a new method for numerically approximating sensitivities in parameter-dependent ordinary differential equations (ODEs). Our approach, intended for situations where the standard forward and adjoint sensitivity analyses become too computationally costly for practical purposes, is based on the Peano-Baker series from control theory. Using this series, we construct a representation of the sensitivity matrix $$\textbf{S}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>S</mml:mi> </mml:math> and, from this representation, a numerical method for approximating $$\textbf{S}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>S</mml:mi> </mml:math> . We prove that, under standard regularity assumptions, the error of our method scales as $$\mathcal {O}(\Delta t^2_{\textrm{max}})$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mi>Δ</mml:mi> <mml:msubsup> <mml:mi>t</mml:mi> <mml:mtext>max</mml:mtext> <mml:mn>2</mml:mn> </mml:msubsup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> , where $$\Delta t_{\textrm{max}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Δ</mml:mi> <mml:msub> <mml:mi>t</mml:mi> <mml:mtext>max</mml:mtext> </mml:msub> </mml:mrow> </mml:math> is the largest time step used when numerically solving the ODE. We illustrate the performance of the method in several numerical experiments, taken from both the systems biology setting and more classical dynamical systems. The experiments show the sought-after improvement in running time of our method compared to the forward sensitivity approach. In experiments involving a random linear system, the forward approach requires roughly $$\sqrt{n}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msqrt> <mml:mi>n</mml:mi> </mml:msqrt> </mml:math> longer computational time, where n is the dimension of the parameter space, than our proposed method.

Authors

Institutions

Publication Details

Journal
Numerische Mathematik
Published
2025-12-17
DOI
https://doi.org/10.1007/s00211-025-01514-2
Primary Topic
Numerical methods for differential equations
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sensitivity approximation by the Peano-Baker series

Olivia Eriksson, Andrei Kramer, Federica Milinanni, Pierre Nyquist
Numerische Mathematik
Numerical methods for differential equations
article

Sensitivity approximation by the Peano-Baker series

Olivia Eriksson, Andrei Kramer, Federica Milinanni, Pierre Nyquist
article en

Abstract

Abstract In this paper we develop a new method for numerically approximating sensitivities in parameter-dependent ordinary differential equations (ODEs). Our approach, intended for situations where the standard forward and adjoint sensitivity analyses become too computationally costly for practical purposes, is based on the Peano-Baker series from control theory. Using this series, we construct a representation of the sensitivity matrix $$\textbf{S}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>S</mml:mi> </mml:math> and, from this representation, a numerical method for approximating $$\textbf{S}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>S</mml:mi> </mml:math> . We prove that, under standard regularity assumptions, the error of our method scales as $$\mathcal {O}(\Delta t^2_{\textrm{max}})$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mi>Δ</mml:mi> <mml:msubsup> <mml:mi>t</mml:mi> <mml:mtext>max</mml:mtext> <mml:mn>2</mml:mn> </mml:msubsup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> , where $$\Delta t_{\textrm{max}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Δ</mml:mi> <mml:msub> <mml:mi>t</mml:mi> <mml:mtext>max</mml:mtext> </mml:msub> </mml:mrow> </mml:math> is the largest time step used when numerically solving the ODE. We illustrate the performance of the method in several numerical experiments, taken from both the systems biology setting and more classical dynamical systems. The experiments show the sought-after improvement in running time of our method compared to the forward sensitivity approach. In experiments involving a random linear system, the forward approach requires roughly $$\sqrt{n}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msqrt> <mml:mi>n</mml:mi> </mml:msqrt> </mml:math> longer computational time, where n is the dimension of the parameter space, than our proposed method.

Numerische MathematikVol. 158(1)
Science for Life Laboratory (SE), Karolinska Institutet (SE), Chalmers University of Technology (SE), KTH Royal Institute of Technology (SE), University of Gothenburg (SE)
Swedish e-Science Research Centre, European Commission, Lunds Universitet, Knut och Alice Wallenbergs Stiftelse, Kungliga Tekniska Högskolan, Vetenskapsrådet, Science for Life Laboratory, HORIZON EUROPE Framework Programme
Openalex Percentile: Top 46%
Numerical methods for 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.