DOI10.1007/s10208-004-0144-zzbMath1109.65046OpenAlexW2015721832MaRDI QIDQ2505645
Marc Giusti, Jean-Claude Yakoubsohn, Bruno Salvy, Grégoire Lecerf
Publication date: 28 September 2006
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-004-0144-z
Near optimal subdivision algorithms for real root isolation,
Efficient hybrid-symbolic methods for quantum mechanical calculations,
Improved two-step Newton's method for computing simple multiple zeros of polynomial systems,
Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one,
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration,
A certified iterative method for isolated singular roots,
Validated Root Enclosures for Interval Polynomials with Multiplicities,
The complexity of subdivision for diameter-distance tests,
Two-step Newton's method for deflation-one singular zeros of analytic systems,
Rounding error analysis of linear recurrences using generating series,
Geometry of polynomials and root-finding via path-lifting,
A subdivision method for computing nearest gcd with certification,
Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers,
Numerical approximation of multiple isolated roots of analytical systems,
Globally convergent, iterative path-following for algebraic equations,
On the probability distribution of singular varieties of given corank,
A new deflation method for verifying the isolated singular zeros of polynomial systems,
From approximate factorization to root isolation with application to cylindrical algebraic decomposition,
Direct computation of elliptic singularities across anisotropic, multi-material edges,
Newton's method with deflation for isolated singularities of polynomial systems,
General local convergence theory for a class of iterative processes and its applications to Newton's method,
On isolation of simple multiple zeros and clusters of zeros of polynomial systems,
Nearest multivariate system with given root multiplicities,
Verified error bounds for singular solutions of nonlinear systems,
Evaluation techniques for zero-dimensional primary decomposition,
Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions,
On the efficient global dynamics of Newton’s method for complex polynomials,
Newton's method in practice: finding all roots of polynomials of degree one million efficiently
