Computing the isolated roots by matrix methods
One approach to compute the roots of a zero-dimensional polynomial system is based on resultant formulations and can be performed with floating point arithmetic. In this paper, reinvestigating the resultant approach from the linear algebra point of view the author handles the problem of genericity and presents a new algorithm for computing the isolated roots of an algebraic variety. The author analyses two types of resultant formulations, transforms them into eigenvector problems, and describes special linear algebra operations on the matrix pencils in order to reduce the root computation to a non-singular eigenvector problem. This new algorithm, based on pencil decompositions, has a good complexity even in the non-generic situations and can be executed with floating point arithmetic.
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Generalized resultants over unirational algebraic varieties
- Improved algorithms for computing determinants and resultants
- Matrices in elimination theory
- Multivariate polynomials, duality, and structured matrices
- Stable normal forms for polynomial system solving
- Bezoutian and quotient ring structure
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- A novel linear algorithm for \(P5P\) problem
- scientific article; zbMATH DE number 1639654 (Why is no real title available?)
- Computing roots of matrix products
- A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
- A unified approach to computing real and complex zeros of zero-dimensional ideals
- Root isolation methods based upon lagrangian interpolation
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- scientific article; zbMATH DE number 1263385 (Why is no real title available?)
- scientific article; zbMATH DE number 503184 (Why is no real title available?)
- Localization and perturbations of roots to systems of polynomial equations
- Multidimensional realisation theory and polynomial system solving
- Overdetermined Weierstrass iteration and the nearest consistent system
- Solving a sparse system using linear algebra
- Separation of the maximum isolated 0-dimensional component of the manifold of roots
- Computation of a specified root of a polynomial system of equations using eigenvectors
- The resultants method for approximating real fixed points of polynomials
- Multivariate polynomial system solving using intersections of eigenspaces.
- Symmetric tensor decomposition
- On the computation of matrices of traces and radicals of ideals
- On the computation of an arrangement of quadrics in 3D
- Using symmetries in the eigenvalue method for polynomial systems
- Blind algebraic identification of communication channels: symbolic solution algorithms
This page was built for publication: Computing the isolated roots by matrix methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281846)
