arXiv (OAI Expanded)
open access
Fast Stencil Computations on a Single Arbitrarily Moving Interval
A stencil computation repeatedly updates every cell of a grid from its neighbours' values at the previous timestep. Simulating T steps on N cells directly costs Theta(NT), and a line of work beginning with Ahmad et al. reduces this by composing many timesteps into one linear operator and applying it
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fast Stencil Computations on a Single Arbitrarily Moving Interval#919353
- ForgeStencil: Automating Per-Case Stencil Specialization from Kernels to 100+ Real Applications#974793
- Massively parallel numerical simulations with Julia#411008
- Leveraging SIMD for Accelerating Large-number Arithmetic#126482
- Function-Space Transformer with Adaptive Anchors#1142949
Record · ID 1084791
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive