Computing multivariate approximate GCD based on Barnett's theorem

Authors:
Masaru Sanuki
Affiliations:
University of Tsukuba, Tsukuba, Japan
Venue:
Proceedings of the 2009 conference on Symbolic numeric computation
Year:
2009

Citing 18
Cited 0

Three new algorithms for multivariate polynomial GCD

Journal of Symbolic Computation
Approximate greatest common divisor of multivariate polynomials and its application to ill-conditioned systems of algebraic equations

Journal of Information Processing
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Displacement structure: theory and applications

SIAM Review
Proposal of “effective floating-point number” for approximate algebraic computation

ACM SIGSAM Bulletin
An analysis of cancellation error in multivariate Hensel construction with floating-point number arithmetic

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations

SIAM Journal on Matrix Analysis and Applications
Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
Fast computation of the Bezout and Dixon resultant matrices

Journal of Symbolic Computation
Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices

Journal of Symbolic Computation
The EZ GCD algorithm

ACM '73 Proceedings of the ACM annual conference
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
The EEZ-GCD algorithm

ACM SIGSAM Bulletin
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computing Approximate GCDs in Ill-conditioned Cases

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
QR factoring to compute the GCD of univariate approximate polynomials

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms for multivariate GCD and approximate GCD by modifying Barnett's theorem, which is based on the LU-decomposition of Bézout matrix. Our method is suited for multivariate polynomials with large degrees. Also, we analyze ill-conditioned cases of our method. We show our method is stabler and faster than many other methods.