Approximate GCD and its application to ill-conditioned algebraic equations
ISCM '90 Proceedings of the International Symposium on Computation mathematics
Algorithms for computer algebra
Algorithms for computer algebra
Well … it isn't quite that simple
ACM SIGSAM Bulletin
Numerical methods for simultaneous diagonalization
SIAM Journal on Matrix Analysis and Applications
Computing selected solutions of polynomial equations
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
A first report on the A# compiler
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
Numerische Mathematik
Detection and validation of clusters of polynomial zeros
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
Solving Systems of Polynomial Equations
IEEE Computer Graphics and Applications
Approximate polynomial greatest common divisors and nearest singular polynomials
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Matrix eigenproblems are at the heart of polynomial system solving
ACM SIGSAM Bulletin
Gröbner bases and matrix eigenproblems
ACM SIGSAM Bulletin
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
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Optimization strategies for the approximate GCD problem
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Report on the SNAP minisymposium at SIAM '98
ACM SIGSAM Bulletin
Efficient algorithms for computing the nearest polynomial with a real root and related problems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Pseudofactors of multivariate polynomials
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Hybrid computation of bivariate rational interpolation
ACM SIGSAM Bulletin
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
A method computing multiple roots of inexact polynomials
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
The approximate GCD of inexact polynomials
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Theoretical Computer Science - Algebraic and numerical algorithm
Parametrization of approximate algebraic curves by lines
Theoretical Computer Science - Algebraic and numerical algorithm
Parametrization of approximate algebraic surfaces by lines
Computer Aided Geometric Design
The nearest polynomial with a given zero, revisited
ACM SIGSAM Bulletin
Approximate radical of ideals with clusters of roots
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Locating real multiple zeros of a real interval polynomial
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Distance bounds of ε-points on hypersurfaces
Theoretical Computer Science
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Computing Approximate GCDs in Ill-conditioned Cases
Proceedings of the 2007 international workshop on Symbolic-numeric computation
A hybrid integral for parametrized rational functions
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Structured matrix-based methods for polynomial ∈-gcd: analysis and comparisons
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Minimum converging precision of the QR-factorization algorithm for real polynomial GCD
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On real factors of real interval polynomials
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
Journal of Symbolic Computation
A structured rank-revealing method for Sylvester matrix
Journal of Computational and Applied Mathematics
Structured total least norm and approximate GCDs of inexact polynomials
Journal of Computational and Applied Mathematics
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation
A computational study of ruled surfaces
Journal of Symbolic Computation
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
Journal of Symbolic Computation
Nearest multivariate system with given root multiplicities
Journal of Symbolic Computation
On real factors of real interval polynomials
Journal of Symbolic Computation
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
An iterative method for calculating approximate GCD of univariate polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The approximate irreducible factorization of a univariate polynomial: revisited
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Pseudospectra for exponential polynomial matrices
Proceedings of the 2009 conference on Symbolic numeric computation
Computing nearest Gcd with certification
Proceedings of the 2009 conference on Symbolic numeric computation
Using symmetries in the eigenvalue method for polynomial systems
Journal of Symbolic Computation
Parametrization of approximate algebraic surfaces by lines
Computer Aided Geometric Design
The ERES method for computing the approximate GCD of several polynomials
Applied Numerical Mathematics
The amended DSeSC power method for polynomial root-finding
Computers & Mathematics with Applications
Computers & Mathematics with Applications
Approximate parametrization of plane algebraic curves by linear systems of curves
Computer Aided Geometric Design
Exact real computation in computer algebra
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Journal of Computational and Applied Mathematics
Blind image deconvolution via fast approximate GCD
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
The calculation of the degree of an approximate greatest common divisor of two polynomials
Journal of Computational and Applied Mathematics
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
New progress in real and complex polynomial root-finding
Computers & Mathematics with Applications
A subdivision method for computing nearest gcd with certification
Theoretical Computer Science
Root-finding by expansion with independent constraints
Computers & Mathematics with Applications
Recursive polynomial remainder sequence and the nested subresultants
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Algebraic geometric comparison of probability distributions
The Journal of Machine Learning Research
The computation of multiple roots of a polynomial
Journal of Computational and Applied Mathematics
Extended companion matrix for approximate GCD
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Using weighted norms to find nearest polynomials satisfying linear constraints
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Univariate polynomial root-finding by arming with constraints
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Journal of Computational and Applied Mathematics
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials
Theoretical Computer Science
Guessing singular dependencies
Journal of Symbolic Computation
Rational Hausdorff divisors: A new approach to the approximate parametrization of curves
Journal of Computational and Applied Mathematics
| Hi-index | 0.01 |