Computer Algebra in Scientific Computing

DOI10.1007/11555964zbMATH Open1169.65315OpenAlexW4300628649MaRDI QIDQ5479232FDOQ5479232

Authors: Arno Eigenwillig, Lutz Kettner, Werner Krandick, K. Mehlhorn, Susanne Schmitt, Nicola Wolpert 

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11555964

Recommendations

• On the complexity of the Descartes method when using approximate arithmetic
• A general approach to isolating roots of a bitstream polynomial
• Isolating real roots of real polynomials
• A deterministic algorithm for isolating real roots of a real polynomial
• When Newton meets Descartes

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to single equations (65H05)

Cited In (20)

• A deterministic algorithm for isolating real roots of a real polynomial
• A general approach to isolating roots of a bitstream polynomial
• Logcf: an efficient tool for real root isolation
• An efficient algorithm for the stratification and triangulation of an algebraic surface
• About the algebraic solutions of smallest enclosing cylinders problems
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Clustering complex zeros of triangular systems of polynomials
• Complete numerical isolation of real roots in zero-dimensional triangular systems
• Isolating real roots of real polynomials
• Univariate real root isolation over a single logarithmic extension of real algebraic numbers
• Root refinement for real polynomials using quadratic interval refinement
• Computing real roots of real polynomials
• A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces
• Arrangements on parametric surfaces. II: Concretizations and applications
• A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
• On the complexity of the Descartes method when using approximate arithmetic
• Univariate real root isolation in an extension field and applications
• On the topology of real algebraic plane curves
• Almost tight recursion tree bounds for the Descartes method
• Exact symbolic-numeric computation of planar algebraic curves

Uses Software

• SYNAPS
• ISOLATE
• na20

This page was built for publication: Computer Algebra in Scientific Computing

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