Answers are grounded in this paper and cite their sources.
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).
No takes yet. Share an insight, caveat, or question.
Giuseppe Natale (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: