On the Computation of 2-Dimensional Recurrence Equations

2024/06/04 by Giuseppe Natale, Natale, Giuseppe
Mathematics · Computer Science · #Numerical methods for differential equations #Algebraic and Geometric Analysis #Advanced Mathematical Modeling in Engineering

paper · pdf · doi:10.48550/arxiv.2406.02082

Abstract

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₂(2n-1).

Related

• Shortest Two-way Linear Recurrences
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• On the integral values of a curious recurrence
• A Solution of Simultaneous Recurrences
• How to Compute a Moving Sum