How much precision is needed to compare two sums of square roots of integers?

DOI10.1016/J.IPL.2006.05.002MaRDI QIDQ845866zbMATH OpenOpenAlexFDO

Authors Jianbo Qian, Cao An Wang

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.05.002

zbMATH Keywords

computational geometrynumerical computationssquare root of integer

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On Comparing Sums of Square Roots of Small Integers
• On the minimum gap between sums of square roots of small integers
• Finding the smallest gap between sums of square roots
• Bounding the sum of square roots via lattice reduction
• On the Sum of Square Roots of Polynomials and Related Problems

Cites work

• A strong and easily computable separation bound for arithmetic expressions involving radicals

Cited in

(10)

• Sums of square roots that are close to an integer
• scientific article; zbMATH DE number 1988975 (Why is no real title available?)
• Approximate equality for two sums of roots
• On the minimum gap between sums of square roots of small integers
• On Comparing Sums of Square Roots of Small Integers
• Finding the smallest gap between sums of square roots
• On the Order of Power Series and the Sum of Square Roots Problem
• Bounding the sum of square roots via lattice reduction
• A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
• Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration

This page was built for publication: How much precision is needed to compare two sums of square roots of integers?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845866)