Nan Li
ABSTRACT
For an isolated breadth-one singular solution xe of a polynomial system F = {f1,..., fn}, fi ∈ C[x1,..., xn] (breadth one means the Jacobian JF (xe) is of corank one), in [6, 7] we present a symbolic-numeric method to refine an approximate solution x with quadratic convergence if x is close to xe. A preliminary implementation performs well in case the approximate Max Noether conditions computed are sparse, but suffers from the evaluation of them when they are not. In this paper we describe how to avoid the linear transformation and evaluate Max Noether conditions efficiently by solving a sequence of least squares problems.
- B. Dayton, T. Li, and Z. Zeng. Multiple zeros of nonlinear systems, 2009. preprint, http://orion.neiu.edu/~zzeng/Papers/MultipleZeros.pdf.Google Scholar
- M. Giusti, G. Lecerf, B. Salvy, and J.-C. Yakoubsohn. On location and approximation of clusters of zeros: case of embedding dimension one. Found. Comput. Math., 7(1):1--58, 2007. Google ScholarDigital Library
- A. Griewank. On solving nonlinear equations with simple singularities or nearly singular solutions. SIAM Review, 27(4):537--563, 1985.Google ScholarCross Ref
- A. Leykin, J. Verschelde, and A. Zhao. Newton's method with deflation for isolated singularities of polynomial systems. Theoretical Computer Science, 359(1):111--122, 2006. Google ScholarDigital Library
- A. Leykin, J. Verschelde, and A. Zhao. Evaluation of jacobian matrices for newton's method with deflation to approximate isolated singular solutions of polynomial systems. In D. Wang and L. Zhi, editors, Symbolic-Numeric Computation, Trends in Mathematics, pages 269--278. Birkhäuser Basel, 2007.Google Scholar
- N. Li and L. Zhi. Compute the multiplicity structure of an isolated singular solution: case of breadth one. MM Research Preprints, 28:93--103, 2009. Accepted for publication in Journal of Symbolic Computation. http://www.mmrc.iss.ac.cn/~lzhi/Publications/jsc_LiZhi2010.pdf. Google ScholarDigital Library
- N. Li and L. Zhi. Computing isolated singular solutions of polynomial systems: case of breadth one. ArXiv Mathematics e-prints, Mar. 2011. http://www.arxiv.com/abs/1008.0061v2.Google Scholar
- A. Mantzaflaris and B. Mourrain. Deflation and certified isolation of singular zeros of polynomial systems. ArXiv Mathematics e-prints, Jan. 2011. http://arxiv.org/abs/1101.3140. Google ScholarDigital Library
- S. Rump and S. Graillat. Verified error bounds for multiple roots of systems of nonlinear equations. Numerical Algorithms, 54(3):359--377, 2009.Google ScholarCross Ref
Index Terms
- An improved method for evaluating Max Noether conditions: case of breadth one
Recommendations
Effective Noether Irreducibility Forms and Applications
Selected papers of the 23rd annual ACM symposium on Theory of computingUsing recent absolute irreducibility testing algorithms, we derive new irreducibility forms. These are integer polynomials in variables which are the generic coefficients of a multivariate polynomial of a given degree. A (multivariate) polynomial over a ...
Effective Noether Irreducibility Forms and Applications
Using recent absolute irreducibility testing algorithms, we derive new irreducibility forms. These are integer polynomials in variables which are the generic coefficients of a multivariate polynomial of a given degree. A (multivariate) polynomial over a ...
From approximate factorization to root isolation
ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic ComputationWe present an algorithm for isolating all roots of an arbitrary complex polynomial p which also works in the presence of multiple roots provided that arbitrary good approximations of the coefficients of p and the number of distinct roots are given. Its ...
Comments