arXiv (All)
open access
Multigrid with Linear Storage Complexity
As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n
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
- Towards provable energy-stable overset grid methods using sub-cell summation-by-parts operators#984898
- SciGRID - Offenes Referenzmodell Europäischer Übertragungsnetze für wissenschaftliche Untersuchungen#1089830
- Technical note: A flexible framework for precision reduction of WRF inputs and outputs to balance storage efficiency and scientific fidelity.#330763
- Application of a hybrid Newton–trust-region algorithm for robust and efficient multiphase isenthalpic flash calculations in CO2 storage simulations#482688
- Decoupling Vector Data and Index Storage for Space Efficiency#196468
Record · ID 1052046
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