Sensitivity Approximation by the Peano-Baker Series
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914865520574464 |
|---|---|
| author | Eriksson, Olivia Kramer, Andrei Milinanni, Federica Nyquist, Pierre |
| author_facet | Eriksson, Olivia Kramer, Andrei Milinanni, Federica Nyquist, Pierre |
| contents | 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 $\mathbf{S}$ and, from this representation, a numerical method for approximating $\mathbf{S}$. We prove that, under standard regularity assumptions, the error of our method scales as $\mathcal{O}(Δt^2_{\text{max}})$, where $Δt_{\text{max}}$ 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}$ longer computational time, where $n$ is the dimension of the parameter space, than our proposed method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_00067 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Sensitivity Approximation by the Peano-Baker Series Eriksson, Olivia Kramer, Andrei Milinanni, Federica Nyquist, Pierre Numerical Analysis 65L05, 65L20 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 $\mathbf{S}$ and, from this representation, a numerical method for approximating $\mathbf{S}$. We prove that, under standard regularity assumptions, the error of our method scales as $\mathcal{O}(Δt^2_{\text{max}})$, where $Δt_{\text{max}}$ 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}$ longer computational time, where $n$ is the dimension of the parameter space, than our proposed method. |
| title | Sensitivity Approximation by the Peano-Baker Series |
| topic | Numerical Analysis 65L05, 65L20 |
| url | https://arxiv.org/abs/2109.00067 |