The singular value decomposition for polynomial systems

@inproceedings{Corless1995TheSV,
  title={The singular value decomposition for polynomial systems},
  author={Robert M Corless and P. Gianni and Barry M. Trager and S. Watt},
  booktitle={ISSAC '95},
  year={1995}
}
  • Robert M Corless, P. Gianni, +1 author S. Watt
  • Published in ISSAC '95 1995
  • Mathematics, Computer Science
  • This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coecients are inexact or imperfectly known. We first give an algorithm for computing univariate GCD’s which gives exact results for interesting nearby problems, and give ecient algorithms for computing precisely how nearby. We generalize this to multivariate GCD computation. Next, we adapt Lazard’s u-resultant algorithm for the solution of overdetermined systems… CONTINUE READING
    231 Citations

    Figures and Topics from this paper

    Approximate factorization of multivariate polynomials using singular value decomposition
    • 66
    • PDF
    Extended companion matrix for approximate GCD
    • 2
    • PDF
    The approximate irreducible factorization of a univariate polynomial: revisited
    • 9
    Computing Lower Rank Approximations of Matrix Polynomials
    • 1
    • Highly Influenced
    • PDF
    Numerical Univariate Polynomial GCD
    • 21
    • PDF
    An ODE-based method for computing the approximate greatest common divisor of polynomials
    • 7
    • PDF
    On Approximate GCDs of Univariate Polynomials
    • 104
    • PDF

    References

    LAPACK User’s Guide
    • 2nd. ed., SIAM
    • 1995