A strong and easily computable separation bound for arithmetic expressionsinvolving radicals

Authors
Burnikel, C Fleischer, R Mehlhorn, K Schirra, S
Citation
C. Burnikel et al., A strong and easily computable separation bound for arithmetic expressionsinvolving radicals, ALGORITHMIC, 27(1), 2000, pp. 87-99
Citations number
18
Categorie Soggetti
Engineering Mathematics
Journal title
ALGORITHMICA
ISSN journal
01784617 → ACNP
Volume
27
Issue
1
Year of publication
2000
Pages
87 - 99
Database
ISI
SICI code
0178-4617(200005)27:1<87:ASAECS>2.0.ZU;2-C
Abstract
We consider arithmetic expressions over operators +, -, *, /, and k root, w ith integer operands. For an expression E having value xi, a separation bou nd sep(E) is a positive real number with the property that xi not equal 0 i mplies \xi\ greater than or equal to sep(E). We propose a new separation bo und that is easy to compute and stronger than previous bounds.