The singular value decomposition for polynomial systems
Robert M. Corless, Patrizia M. Gianni, Barry Trager et al. · International Symposium on Symbolic and Algebraic Computation · 1995
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients 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 efficient 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 of polynomial equations to the inexact-coefficient case. We also briefly discuss an application of the modied Lazard's method to the location of singular points on approximately known projections of algebraic curves.
Cited by 203 works. doi:10.1145/220346.220371
Authors
References
- Matrix Computations
- Matrix Analysis
- Numerical Methods for Simultaneous Diagonalization
- Resolution des systemes d'equations algebriques
- Effective Polynomial Computation
- An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations
- Quasi-GCD computations
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Well … it isn't quite that simple
- Solving systems of polynomial equations