arXiv (OAI Expanded)
open access
Batched Wavefront Sweeps for Linear Transport Uncertainty Quantification
We develop a graph-compatible batched wavefront formulation for upwind discontinuous Galerkin discretisations of linear transport. For sweepable discretisations, the cell equations form a block lower-triangular system under a topological ordering of the directed upwind dependency graph. This causal
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
- Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification#1154795
- Sharp Norms from Finite Structure: Graph Matrices and Structured Chaoses#1083722
- Fast Stencil Computations on a Single Arbitrarily Moving Interval#1084791
- Fast Stencil Computations on a Single Arbitrarily Moving Interval#919353
- An STP-based model toward designing binary diffusion layers with the lowest latency#328174
Record · ID 1084443
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