Checking approximate computations over the reals

DOI10.1145/167088.167288zbMath1310.65176OpenAlexW2064968474MaRDI QIDQ5248550

Sigal Ar, Manuel Blum, Bruno Codenotti, Peter S. Gemmell

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167288

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Complexity and performance of numerical algorithms (65Y20) Numerical linear algebra (65Fxx)

Related Items (8)

Checking properties of polynomials ⋮ Approximate testing with error relative to input size. ⋮ Program result checking: A new approach to making programs more reliable ⋮ Self-correcting for function fields of finite transcendental degree ⋮ A fast randomized algorithm for the approximation of matrices ⋮ Spot-checkers ⋮ Unnamed Item ⋮ Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching

This page was built for publication: Checking approximate computations over the reals