arXiv (All)
open access
A framework for trackable and modular rounding error analysis
Robust and meaningful rounding error analysis is becoming increasingly challenging as modern numerical computations involve a rapidly evolving variety of arithmetic formats, precisions, and computational kernels. We propose a trackable and modular framework for rounding error analysis, together with
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
- Golden Ruler: A Numeric Format Catalog with Bit-Exact Conformance Vectors for FP8, BF16, MXFP4, and Microscaling Formats#971820
- FPScan: An Automated Constraint-Based Analyzer for Floating-Point Anomaly Detection#984410
- Approximation algorithms via discrepancy with hard constraints#1327669
- An 84-Format Numeric Catalog with Bit-Exact Conformance Vectors: A Vendor-Neutral Reference for FP8, BF16, MXFP4, and Microscaling Formats#267688
- VIREL: Verified Integer-Residual Encoding on Lattices for Exact and Error-Bounded Floating-Point Time-Series Compression#411168
Record · ID 1458890
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