- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real or complex multivariate polynomials such that the deformed polynomials… Expand

We present a stable and practical algorithm that uses QR factors of the Sylvester matrix to compute the greatest common divisor (GCD) of univariate approximate polynomials over /spl Ropf/[x] or /spl… Expand

The task of determining the approximate greatest common divisor (GCD) of univariate polynomials with inexact coefficients can be formulated as computing for a given Sylvester matrix a new Sylvester… Expand

We generalize the technique by Peyrl and Parillo [Proc. SNC 2007] to computing lower bound certificates for several well-known factorization problems in hybrid symbolic-numeric computation. The idea… Expand

The problem of blind image deconvolution can be solved by computing approximate greatest common divisors (GCD) of polynomials. The bivariate polynomials corresponding to the z-transforms of several… Expand

The input to our algorithm is a multivariate polynomial, whose complex rational coefficients are considered imprecise with an unknown error that causes f to be irreducible over the complex numbers C.… Expand

Consider a general polynomial system S in x1, . . . , xn of degree q and its corresponding vector of monomials of degree less than or equal to q. The system can be written as M0 · [xq1, xq−1 1 x2, .… Expand

There has been considerable progress in the theory and computer implementation of symbolic computation algorithms to automatically determine and exploit exact symmetries of exact differential… Expand

We present an explicit algorithm to compute a closed basis of the local dual space of I=(f1,?,ft) at a given isolated singular solution x?=(x?1,?,x?s) when the Jacobian matrix J(x?) has corank one.… Expand

Given two polynomials F and G in R[x1, . . . , xn], we are going to find the nontrivial approximate GCD C and polynomials F , G ∈ R[x1, . . . , xn] such that ||F − CF ′|| 1. Approximate GCD… Expand