Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
On condition numbers and the distance to the nearest III-posted problem
Numerische Mathematik
Algorithms for intersecting parametric and algebraic curves II: multiple intersections
Graphical Models and Image Processing
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Approximate polynomial greatest common divisors and nearest singular polynomials
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient algorithms for computing the nearest polynomial with constrained roots
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On approximate GCDs of univariate polynomials
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Explaining and ameliorating the ill condition of zeros of polynomials.
Explaining and ameliorating the ill condition of zeros of polynomials.
Efficient algorithms for computing the nearest polynomial with constrained roots
Efficient algorithms for computing the nearest polynomial with constrained roots
Pseudofactors of multivariate polynomials
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Towards factoring bivariate approximate polynomials
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
The nearest polynomial with a given zero, and similar problems
ACM SIGSAM Bulletin
Pseudozeros of multivariate polynomials
Mathematics of Computation
Towards certified irreducibility testing of bivariate approximate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On approximate irreducibility of polynomials in several variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Approximate factorization of multivariate polynomials via differential equations
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
On computing nearest singular hankel matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
A note on a nearest polynomial with a given root
ACM SIGSAM Bulletin
The nearest polynomial with a given zero, revisited
ACM SIGSAM Bulletin
Locating real multiple zeros of a real interval polynomial
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
The nearest polynomial with a zero in a given domain
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract)
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate GCDs of polynomials and SOS relaxation
Proceedings of the 2007 international workshop on Symbolic-numeric computation
On real factors of real interval polynomials
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation
The nearest polynomial with a zero in a given domain from a geometrical viewpoint
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
Computer Mathematics
Approximate GCDs of polynomials and sparse SOS relaxations
Theoretical Computer Science
The nearest polynomial with a zero in a given domain
Theoretical Computer Science
Nearest multivariate system with given root multiplicities
Journal of Symbolic Computation
On real factors of real interval polynomials
Journal of Symbolic Computation
Extracting numerical factors of multivariate polynomials from taylor expansions
Proceedings of the 2009 conference on Symbolic numeric computation
Resultants and neighborhoods of a polynomial
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
Journal of Symbolic Computation
The nearest complex polynomial with a zero in a given complex domain
Theoretical Computer Science
Using weighted norms to find nearest polynomials satisfying linear constraints
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Computing the nearest singular univariate polynomials with given root multiplicities
Theoretical Computer Science
| Hi-index | 0.00 |