AbstractWe present a method based on symbolic–numeric reduction to geometric involutive form to compute the primary component of and a basis of Max Noether space for a polynomial system at an isolated singular solution. The singular solution can be known exactly or approximately. For the case where the singular solution is known with limited accuracy, we then propose a generalized quadratic Newton iteration for refining it to high accuracy
AbstractMany problems give rise to polynomial systems. These systems often have several parameters a...
AbstractThe Behavior of the Newton-Raphson method at the singular roots has been studied by a number...
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system with...
AbstractWe present a method based on symbolic–numeric reduction to geometric involutive form to comp...
AbstractWe present a modification of Newton's method to restore quadratic convergence for isolated s...
AbstractWe briefly survey several existing methods for solving polynomial systems with inexact coeff...
International audienceWe develop a new symbolic-numeric algorithm for the certification of singular ...
We present a modification of Newton's method to restore quadratic convergence for isolated sing...
International audienceSingular zeros of systems of polynomial equations constitute a bottleneck when...
Abstract. We present a method based on symbolic-numeric reduction to geometric involutive form to co...
AbstractA method to generate accurate approximations to the singular solutions of a system of (compl...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
International audienceThis paper presents two new constructions related to singular solutions of pol...
AbstractWe present an explicit algorithm to compute a closed basis of the local dual space of I=(f1,...
In this paper, we propose a symbolic-numeric algorithm to count the number of solutions of a zero-di...
AbstractMany problems give rise to polynomial systems. These systems often have several parameters a...
AbstractThe Behavior of the Newton-Raphson method at the singular roots has been studied by a number...
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system with...
AbstractWe present a method based on symbolic–numeric reduction to geometric involutive form to comp...
AbstractWe present a modification of Newton's method to restore quadratic convergence for isolated s...
AbstractWe briefly survey several existing methods for solving polynomial systems with inexact coeff...
International audienceWe develop a new symbolic-numeric algorithm for the certification of singular ...
We present a modification of Newton's method to restore quadratic convergence for isolated sing...
International audienceSingular zeros of systems of polynomial equations constitute a bottleneck when...
Abstract. We present a method based on symbolic-numeric reduction to geometric involutive form to co...
AbstractA method to generate accurate approximations to the singular solutions of a system of (compl...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
International audienceThis paper presents two new constructions related to singular solutions of pol...
AbstractWe present an explicit algorithm to compute a closed basis of the local dual space of I=(f1,...
In this paper, we propose a symbolic-numeric algorithm to count the number of solutions of a zero-di...
AbstractMany problems give rise to polynomial systems. These systems often have several parameters a...
AbstractThe Behavior of the Newton-Raphson method at the singular roots has been studied by a number...
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system with...