Zero tests for constants in simple scientific computation

DOI10.1007/S11786-007-0002-XMaRDI QIDQ2465574zbMATH OpenOpenAlexFDO

Authors Daniel C. Richardson

Publication date 4 January 2008

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-007-0002-x

zbMATH Keywords

Schanuel conjecturezero testexp-log constants

Mathematics Subject Classification ID

Elementary functions (26A09) Complexity of computation (including implicit computational complexity) (03D15) Algebraic independence; Gel'fond's method (11J85)

Recommendations

• scientific article; zbMATH DE number 1263350
• scientific article; zbMATH DE number 1263427
• A note on the decidability of exponential terms
• How to recognize zero?
• scientific article; zbMATH DE number 1305089

Cited in

(11)

• Effective asymptotics analysis for finance
• Guessing singular dependencies
• In Praise of Numerical Computation
• A new graph characteristic and its application to numerical computability
• Multiplicative independence of algebraic numbers and expressions
• Counterexamples to the uniformity conjecture
• Model checking single agent behaviours by fluid approximation
• Checking individual agent behaviours in Markov population models by fluid approximation
• Meta-expansion of transseries
• A note on the decidability of exponential terms
• Calcium. Computing in exact real and complex fields

This page was built for publication: Zero tests for constants in simple scientific computation

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