A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots
Robert M. Corless, Patrizia M. Gianni, Barry Trager · International Symposium on Symbolic and Algebraic Computation · 1997
\Ve discuss the use of a single generic linear combination of multiplication matrices, and its reordered Schur factorization, to find the roots of a system of multivariate polynomial equations.The principal contribution of this paper is to show how to reduce thr multivariate problem to a univariate problem, even in the raw of multiple roots, in a numerically stable wav,
Cited by 85 works. doi:10.1145/258726.258767 Open-access PDF
Authors
References
- Numerical Methods for Simultaneous Diagonalization
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering
- An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations
- The singular value decomposition for polynomial systems
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Analysis of zero clusters in multivariate polynomial systems
- Detection and Validation of Clusters of Polynomial Zeros
- Matrix eigenproblems are at the heart of polynomial system solving
- Algorithms for Intersecting Parametric and Algebraic Curves II: Multiple Intersections
- The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence