On the Computation of 2-Dimensional Recurrence Equations
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914822138888192 |
|---|---|
| author | Natale, Giuseppe |
| author_facet | Natale, Giuseppe |
| contents | The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming proportional to $log_2(2n-1)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_02082 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Computation of 2-Dimensional Recurrence Equations Natale, Giuseppe Data Structures and Algorithms Computational Complexity Distributed, Parallel, and Cluster Computing G.1.0 F.1.2; F.2.1 The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming proportional to $log_2(2n-1)$. |
| title | On the Computation of 2-Dimensional Recurrence Equations |
| topic | Data Structures and Algorithms Computational Complexity Distributed, Parallel, and Cluster Computing G.1.0 F.1.2; F.2.1 |
| url | https://arxiv.org/abs/2406.02082 |