Remarks on automatic algorithm stabilization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1500722
- scientific article; zbMATH DE number 3408824
- Towards Automatic Convergence Verification of Self-stabilizing Algorithms
- On the mechanism of recursive stability-test algorithms
- On stabilization in Herman's algorithm
- scientific article; zbMATH DE number 702045
- scientific article; zbMATH DE number 2013825
- scientific article; zbMATH DE number 494451
Cited in
(12)- Automatic GKS Stability Analysis
- Term cancellations in computing floating-point Gröbner bases
- Isolating the real roots of the piecewise algebraic variety
- A new Gröbner basis conversion method based on stabilization techniques
- A practical method for floating-point Gröbner basis computation
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- Reducing exact computations to obtain exact results based on stabilization techniques
- On real factors of real interval polynomials
- Subideal border bases
- Approximate computation of zero-dimensional polynomial ideals
- Using the interval-symbol method with zero rewriting to factor polynomials over algebraic number fields
- Pivoting in extended rings for computing approximate Gröbner bases
This page was built for publication: Remarks on automatic algorithm stabilization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281849)