Remarks on automatic algorithm stabilization

DOI10.1006/jsco.1998.0238zbMath0917.65130OpenAlexW2042842356MaRDI QIDQ1281849

Kiyoshi Shirayanagi, Moss Eisenberg Sweedler

Publication date: 25 July 1999

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

Full work available at URL: https://doi.org/10.1006/jsco.1998.0238

zbMATH Keywords

approximate computationinexact computationalgorithm stabilizationperformance of algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Complexity and performance of numerical algorithms (65Y20)

Related Items (10)

Subideal border bases ⋮ A new Gröbner basis conversion method based on stabilization techniques ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ Pivoting in extended rings for computing approximate Gröbner bases ⋮ Term Cancellations in Computing Floating-Point Gröbner Bases ⋮ Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation ⋮ A Practical Method for Floating-Point Gröbner Basis Computation ⋮ Approximate computation of zero-dimensional polynomial ideals ⋮ On real factors of real interval polynomials ⋮ Isolating the real roots of the piecewise algebraic variety

This page was built for publication: Remarks on automatic algorithm stabilization