Polynomial time solutions of some problems of computational algebra
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Approximate square-free decomposition and root-finding of lll-conditioned algebraic equations
Journal of Information Processing
On computing determinants of matrices without divisions
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Solutions of systems of algebraic equations and linear maps on residue class rings
Journal of Symbolic Computation
Computing singular solutions to polynomial systems
Advances in Applied Mathematics
Algorithms for intersecting parametric and algebraic curves II: multiple intersections
Graphical Models and Image Processing
Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
Numerische Mathematik
Gröbner duality and multiplicities in polynomial system solving
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Analysis of zero clusters in multivariate polynomial systems
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Gröbner bases and matrix eigenproblems
ACM SIGSAM Bulletin
Computing multidimensional residues
Algorithms in algebraic geometry and applications
A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Detection and validation of clusters of polynomial zeros
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
On multiple zeros of systems of algebraic equations
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Efficient computation of minimal polynomials in algebraic extensions of finite fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Accurate Singular Value Decompositions of Structured Matrices
SIAM Journal on Matrix Analysis and Applications
On approximate irreducibility of polynomials in several variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A method computing multiple roots of inexact polynomials
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
On the Conditioning of the Nonsymmetric Eigenproblem: Theory and Software
On the Conditioning of the Nonsymmetric Eigenproblem: Theory and Software
Numerical Polynomial Algebra
Nonlinear Polynomial Systems: Multiple Roots and Their Multiplicities
SMI '04 Proceedings of the Shape Modeling International 2004
Computing the multiplicity structure in solving polynomial systems
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Generalized normal forms and polynomial system solving
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On approximate triangular decompositions in dimension zero
Journal of Symbolic Computation
Numerical local rings and local solution of nonlinear systems
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Moment matrices, trace matrices and the radical of ideals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Nearest multivariate system with given root multiplicities
Journal of Symbolic Computation
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
On the computation of matrices of traces and radicals of ideals
Journal of Symbolic Computation
Approximately singular systems and ill-conditioned polynomial systems
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Hi-index | 0.00 |
We present a method based on Dickson's lemma to compute the "approximate radical" of a zero dimensional ideal I in C[x1, . . . , xm] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small clusters. Our method is "global" in the sense that it does not require any local approximation of the zero clusters: it reduces the problem to the computation of the numerical nullspace of the so called "matrix of traces", a matrix computable from the generating polynomials of I. To compute the numerical nullspace of the matrix of traces we propose to use Gauss elimination with pivoting, and we prove that if I has k distinct zero clusters each of radius at most ε in the ∞-norm, then k steps of Gauss elimination on the matrix of traces yields a submatrix with all entries asymptotically equal to ε2. We also prove that the computed approximate radical has one root in each cluster with coordinates which are the arithmetic mean of the cluster, up to an error term asymptotically equal to ε2. In the univariate case our method gives an alternative to known approximate square-free factorization algorithms which is simpler and its accuracy is better understood.