Twin-float arithmetic

DOI10.1016/J.JSC.2011.12.005zbMATH Open1298.68298OpenAlexW2034090322MaRDI QIDQ412221FDOQ412221

Authors: John Abbott 

Publication date: 4 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.005

Recommendations

• scientific article; zbMATH DE number 516973
• Floating-point arithmetic in the Coq system
• Floating point Gröbner bases.
• scientific article; zbMATH DE number 1263361
• Computing floating-point Gröbner bases accurately

zbMATH Keywords

heuristically guaranteed finite-precision arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• The approximate GCD of inexact polynomials
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Computing and using minimal polynomials
• Binary Integer Decimal-Based Floating-Point Multiplication

Uses Software

• CoCoA
• CoCoALib
• MultRoot

This page was built for publication: Twin-float arithmetic

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