Real Algebraic Numbers: Complexity Analysis and Experimentation
From MaRDI portal
Publication:5302765
DOI10.1007/978-3-540-85521-7_4zbMath1165.65315OpenAlexW1748106532WikidataQ57908747 ScholiaQ57908747MaRDI QIDQ5302765
Mourrain, Bernard, Ioannis Z. Emiris, Elias P. Tsigaridas
Publication date: 13 January 2009
Published in: Reliable Implementation of Real Number Algorithms: Theory and Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85521-7_4
Complexity and performance of numerical algorithms (65Y20) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (16)
The complexity of approximating the complex-valued Potts model ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Real algebraic numbers and polynomial systems of small degree ⋮ Complexity of real root isolation using continued fractions ⋮ Improved bounds for the CF algorithm ⋮ On the topology of real algebraic plane curves ⋮ An algorithm for addressing the real interval eigenvalue problem ⋮ The nearest complex polynomial with a zero in a given complex domain ⋮ Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions ⋮ SqFreeEVAL: An (almost) optimal real-root isolation algorithm ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ Univariate real root isolation in an extension field and applications ⋮ On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers ⋮ Subdivision methods for solving polynomial equations ⋮ On the asymptotic and practical complexity of solving bivariate systems over the reals ⋮ The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
Uses Software
This page was built for publication: Real Algebraic Numbers: Complexity Analysis and Experimentation
