Irreducibility of multivariate polynomials
Journal of Computer and System Sciences
Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
Approximate square-free decomposition and root-finding of lll-conditioned algebraic equations
Journal of Information Processing
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Asymptotically fast solution of Toeplitz-like singular linear systems
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Mathematics of Computation
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Matrix computations (3rd ed.)
Solving some overdetermined polynomial systems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Deformation techniques for efficient polynomial equation solving
Journal of Complexity
On Wiedemann's Method of Solving Sparse Linear Systems
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Approximate factorization of multivariate polynomials via differential equations
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
On the complexity of computing determinants
Computational Complexity
Generalized normal forms and polynomial system solving
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Condition Numbers of Gaussian Random Matrices
SIAM Journal on Matrix Analysis and Applications
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Symbolic-Numeric Computation (Trends in Mathematics)
Symbolic-Numeric Computation (Trends in Mathematics)
The condition number of a randomly perturbed matrix
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
QR factoring to compute the GCD of univariate approximate polynomials
IEEE Transactions on Signal Processing
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Blind image deconvolution via fast approximate GCD
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Supersparse black box rational function interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Sparse multivariate function recovery from values with noise and outlier errors
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values. We develop a new hybrid algorithm based on Zippel's original sparse polynomial interpolation technique. We show experimentally that our algorithm can handle sparse polynomials with large degrees. We also give a (partial) mathematical justification why the Zippel's algebraic randomization technique can be used with our approximate data: the randomly generated non-zero values are expected to be bounded away from zero. We show that the random Fourier-like matrices arising in our algorithm, have the desired rank property in the exact case, and appear usable numerically. Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values. We develop a new hybrid algorithm based on Zippel's original sparse polynomial interpolation technique. We show experimentally that our algorithm can handle sparse polynomials with large degrees. We also give a (partial) mathematical justification why the Zippel's algebraic randomization technique can be used with our approximate data: the randomly generated non-zero values are expected to be bounded away from zero. We show that the random Fourier-like matrices arising in our algorithm, have the desired rank property in the exact case, and appear usable numerically.