Computation of a specified root of a polynomial system of equations using eigenvectors
DOI10.1016/S0024-3795(00)00190-7zbMath0973.65038OpenAlexW2077508398MaRDI QIDQ5926400
Mourrain, Bernard, Pan, Victor Y., Bondyfalat, Didier
Publication date: 3 December 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(00)00190-7
algorithmsGröbner basismatrix methodsnumerical examplesconvergence accelerationeigenvectormatrix eigenproblemoverconstrained polynomial systemsparameterized polynomial systemsresultantsSchur complementsparse matraicessystems of polynomial equations
Numerical computation of solutions to systems of equations (65H10) Eigenvalues, singular values, and eigenvectors (15A18) Equations in general fields (12E12)
Related Items
Cites Work
- Multidimensional structured matrices and polynomial systems
- Résolution des systèmes d'équations algébriques
- Multipolynomial resultant algorithms
- Computing the isolated roots by matrix methods
- Isolated points, duality and residues
- A unifying approach to some old and new theorems on distribution and clustering
- Multivariate polynomials, duality, and structured matrices
- Géométrie des points épais
- Matrix eigenproblems are at the heart of polynomial system solving
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item