Numerical Polynomial Algebra

The approximate GCD of inexact polynomials

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Computing the multiplicity structure in solving polynomial systems

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

Generalized normal forms and polynomial system solving

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

A note on a nearest polynomial with a given root

ACM SIGSAM Bulletin

Pseudozero set of interval polynomials

Proceedings of the 2006 ACM symposium on Applied computing

Computational communicative algebra

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Approximate radical of ideals with clusters of roots

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Computing real roots of a polynomial in Chebyshev series form through subdivision

Applied Numerical Mathematics

A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set

Journal of Complexity

Newton's method with deflation for isolated singularities of polynomial systems

Theoretical Computer Science

Output frequency response function of nonlinear Volterra systems

Automatica (Journal of IFAC)

Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine

Applied Numerical Mathematics

Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials

Journal of Computational and Applied Mathematics

Book review:

Interfaces

On approximate triangular decompositions in dimension zero

Journal of Symbolic Computation

Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries

Computers & Mathematics with Applications

Border bases of positive dimensional polynomial ideals

Proceedings of the 2007 international workshop on Symbolic-numeric computation

Numerical local rings and local solution of nonlinear systems

Proceedings of the 2007 international workshop on Symbolic-numeric computation

Global minimization of rational functions and the nearest GCDs

Journal of Global Optimization

Computing the multiplicity structure from geometric involutive form

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation

Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis

Computer Mathematics

Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation

Computer Mathematics

Stable normal forms for polynomial system solving

Theoretical Computer Science

Stable border bases for ideals of points

Journal of Symbolic Computation

Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method

Journal of Computational and Applied Mathematics

ApaTools: a software toolbox for approximate polynomial algebra

ACM Communications in Computer Algebra

Solving polynomial systems via symbolic-numeric reduction to geometric involutive form

Journal of Symbolic Computation

A prolongation-projection algorithm for computing the finite real variety of an ideal

Theoretical Computer Science

On delineability of varieties in CAD-based quantifier elimination with two equational constraints

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

Lower bounds for zero-dimensional projections

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

Application of filter diagonalization method to numerical solution of algebraic equations

Proceedings of the 2009 conference on Symbolic numeric computation

Approximate computation of zero-dimensional polynomial ideals

Journal of Symbolic Computation

Almost vanishing polynomials for sets of limited precision points

Journal of Symbolic Computation

Sweeping algebraic curves for singular solutions

Journal of Computational and Applied Mathematics

Algebraic and numerical algorithms

Algorithms and theory of computation handbook

Term cancellations in computing floating-point Gröbner bases

CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing

Artificial discontinuities of single-parametric Gröbner bases

Journal of Symbolic Computation

An algorithm for addressing the real interval eigenvalue problem

Journal of Computational and Applied Mathematics

Diversification improves interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Rounding coefficients and artificially underflowing terms in non-numeric expressions

ACM Communications in Computer Algebra

The nearest complex polynomial with a zero in a given complex domain

Theoretical Computer Science

Interfacing with the numerical homotopy algorithms in PHCpack

ICMS'06 Proceedings of the Second international conference on Mathematical Software

Hybrid method for solving new pose estimation equation system

IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications

Intervals, syzygies, numerical gröbner bases: a mixed study

CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing

Computing the multiplicity structure of an isolated singular solution: Case of breadth one

Journal of Symbolic Computation

Algebraic geometric comparison of probability distributions

The Journal of Machine Learning Research

Numerical calculation of H-bases for positive dimensional varieties

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One

SIAM Journal on Numerical Analysis

Zero-dimensional ideals of limited precision points

ACM Communications in Computer Algebra

Computing real solutions of polynomial systems via low-rank moment matrix completion

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Selecting lengths of floats for the computation of approximate Gröbner bases

Journal of Symbolic Computation

A regularization approach for estimating the type of a plane curve singularity

Theoretical Computer Science

Computing the nearest singular univariate polynomials with given root multiplicities

Theoretical Computer Science

Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one

Theoretical Computer Science

Simple varieties for limited precision points

Theoretical Computer Science

Verified error bounds for real solutions of positive-dimensional polynomial systems

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Hand-Eye calibration without hand orientation measurement using minimal solution

ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV

Algorithm 931: An algorithm and software for computing multiplicity structures at zeros of nonlinear systems

ACM Transactions on Mathematical Software (TOMS)

Review: Recent progress on variable projection methods for structured low-rank approximation

Signal Processing

NAClab: a Matlab toolbox for numerical algebraic computation

ACM Communications in Computer Algebra