Reducing Interpolation on Multi-Grid to Quantizing Grid's Data-Base as a Recursion
Roman Gitlin

TL;DR
This paper introduces a recursive framework for multi-grid interpolation that isolates its core, enabling significant speed improvements in multi-dimensional interpolation through structural optimization techniques.
Contribution
It presents a novel recursive scheme for multi-grid interpolation that enhances computational efficiency and provides a structural basis for optimization techniques.
Findings
Interpolation speed improved by multiple orders of magnitude.
Structural framework isolates recursive core for optimization.
Applicable to multi-dimensional interpolation algorithms.
Abstract
In his article "Powerlist: A Structure for Parallel Recursion" Jayadev Misra wrote: "Many data parallel algorithms Fast Fourier Transform, Batcher's sorting schemes and prefix sum -exhibit recursive structure. We propose a data structure, powerlist, that permits succinct descriptions of such algorithms, highlighting the roles of both parallelism and recursion. Simple algebraic properties of this data structure can be exploited to derive properties of these algorithms and establish equivalence of different algorithms that solve the same problem." The quote above illustrates a widely shared assumption about recursion implementations: either they are done in purely structural terms or they cannot be done at all. Multi-dimensional interpolation on a grid is one of hosts of semi-recursive schemes that, while often referred to as recursive and routinely described in vaguely recursive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Advanced Data Compression Techniques · Computational Physics and Python Applications
