When can forward stable algorithms be composed stably?
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911936865632256 |
|---|---|
| author | Beltrán, Carlos Noferini, Vanni Vannieuwenhoven, Nick |
| author_facet | Beltrán, Carlos Noferini, Vanni Vannieuwenhoven, Nick |
| contents | We state some widely satisfied hypotheses, depending only on two functions $g$ and $h$, under which the composition of a stable algorithm for $g$ and a stable algorithm for $h$ is a stable algorithm for the composition $g \circ h$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_10610 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | When can forward stable algorithms be composed stably? Beltrán, Carlos Noferini, Vanni Vannieuwenhoven, Nick Numerical Analysis 68Q17, 65G50, 65G99, 68Q99 We state some widely satisfied hypotheses, depending only on two functions $g$ and $h$, under which the composition of a stable algorithm for $g$ and a stable algorithm for $h$ is a stable algorithm for the composition $g \circ h$. |
| title | When can forward stable algorithms be composed stably? |
| topic | Numerical Analysis 68Q17, 65G50, 65G99, 68Q99 |
| url | https://arxiv.org/abs/2109.10610 |