Some Numerical Experiments on Round-off Error Growth in Finite Precision Numerical Computation
Suvarna Fadnavis
Abstract
Finite precision computations using digital computers involve the following inherent errors: (1) Round-off error of finite precision computations (2) Binary computer arithmetic precludes exact number representation of traditional decimal system used in data input stage to the computer. Though the round-off error is as small as in the seventh decimal place (single precision) in the beginning, it can enter the mainstream computation within 50 iterations in iterative computations, such as that used in numerical integration schemes, for example, the commonly used fourth order Runge-Kutta method. Growth of round-off error in recursive vis-a-vis iterative computing is described in the text. In this paper several computational experiments are presented to demonstrate the rapid growth of round-off error in iterative computations.
Create a lesson
Related papers
Identifying the Shear Piezoelectric Coefficient using Physics-Informed Neural Networks under Exact Boundary and Initial Constraints
Suhas Suresh Bharadwaj
Fracture-Bench: A Controlled Benchmark Suite for Machine Learning Surrogates in Phase-Field Fracture Mechanics
Meenu Krishnan U., Maryam Hakimzadeh, Indrashish Saha et al.
Noise-resilient collective order through temporal memory in self-propelled particles
Mihir Durve, Sauro Succi, Antonio Celani
Site-orbit masked twin-branch Transformer for symmetry-constrained crystal generation
Junchi Liu, Haoran Si, Luo Yan et al.
Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm
Kayo Kinjo, Jun Ohkubo
Quantum simulation of dissipative acoustic and elastic waves by Schrödingerisation: absorbing boundaries and explicit polynomial-size circuits
Hoang Anh Nguyen, Ali Tura