Approximate rational arithmetics and arbitrary precision computations
Grigori Litvinov, Anatoli Rodionov, Andrei Chourkin
Abstract
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments are given in order to compare efficiency and accuracy of different types of approximate arithmetics and rounding procedures.
Create a lesson
Related papers
Sensitivity Calculus and its Numerical Implementation for Multi-D Hyperbolic Balance Laws
Olivia Dreßen, Michael Herty, Adrian Kolb et al.
A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New
Wanjie Lyu, Xiaojie Wang, Bin Yang
Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers
Nilo Schwencke, Roland Maier
Incremental Column Subset Selection via Conditional Determinantal Point Processes
Laura Grigori, Zhipeng Xue
A Hybrid High-Order Method for the Elasticity Problem with Linear Slip Interface
Erik Burman, Peiqi Huang
Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model
Stefan Schnake, Miroslav Stoyanov, Eirik Endeve et al.