A new idea on the interval-symbol method with correct zero rewriting for reducing exact computations

DOI10.1145/3055282.3055295MaRDI QIDQ5268827zbMATH OpenOpenAlexWikidataFDO

Authors Akiyuki Katayama, Kiyoshi Shirayanagi

Publication date 21 June 2017

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Effect of the interval-symbol method with correct zero rewriting on the \(\delta\)-LLL algorithm
• On interval methods with zero rewriting and exact geometric computation
• Towards more precise rewriting approximations
• Towards more precise rewriting approximations
• An application of Reid-Zhi's symbolic-numeric elimination method
• Efficient reformulation for 0-1 programs -- methods and computational results
• Formal aspects of correctness and optimality of interval computations
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination

Cites work

• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• Reducing exact computations to obtain exact results based on stabilization techniques

Cited in

(4)

• On interval methods with zero rewriting and exact geometric computation
• Effect of the interval-symbol method with correct zero rewriting on the \(\delta\)-LLL algorithm
• Reducing exact computations to obtain exact results based on stabilization techniques
• Difference equations and Sobolev orthogonal polynomials, generated by Meixner polynomials

This page was built for publication: A new idea on the interval-symbol method with correct zero rewriting for reducing exact computations

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