Sensitivity analysis of fractional linear systems based on random walks with negligible memory usage
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913461992161280 |
|---|---|
| author | Centeno, Andrés Acebrón, Juan A. Monteiro, José |
| author_facet | Centeno, Andrés Acebrón, Juan A. Monteiro, José |
| contents | A random walk-based method is proposed to efficiently compute the solution of a large class of fractional in time linear systems of differential equations (linear F-ODE systems), along with the derivatives with respect to the system parameters. Such a method is unbiased and unconditionally stable, and can therefore be used to provide an unbiased estimation of individual entries of the solution, or the full solution. By using stochastic differentiation techniques, it can be used as well to provide unbiased estimators of the sensitivities of the solution with respect to the problem parameters without any additional computational cost. The time complexity of the algorithm is discussed here, along with suitable variance bounds, which prove in practice the convergence of the algorithm. Finally, several test cases were run to assess the validity of the algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_04351 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Sensitivity analysis of fractional linear systems based on random walks with negligible memory usage Centeno, Andrés Acebrón, Juan A. Monteiro, José Numerical Analysis A random walk-based method is proposed to efficiently compute the solution of a large class of fractional in time linear systems of differential equations (linear F-ODE systems), along with the derivatives with respect to the system parameters. Such a method is unbiased and unconditionally stable, and can therefore be used to provide an unbiased estimation of individual entries of the solution, or the full solution. By using stochastic differentiation techniques, it can be used as well to provide unbiased estimators of the sensitivities of the solution with respect to the problem parameters without any additional computational cost. The time complexity of the algorithm is discussed here, along with suitable variance bounds, which prove in practice the convergence of the algorithm. Finally, several test cases were run to assess the validity of the algorithm. |
| title | Sensitivity analysis of fractional linear systems based on random walks with negligible memory usage |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2408.04351 |