Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems

DOI10.1007/s002110050122zbMath0851.65029OpenAlexW2030143626MaRDI QIDQ1893493

Hans J. Stetter, Hans-Michael Möller

Publication date: 26 November 1996

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110050122

zbMATH Keywords

eigenvalueGröbner basiseigenvectorsystems of polynomial equationsisolated zerosmultiple zerosnonderogatory matriceseigenproblem approachJordan normal form decompositionmatrix eigenproblems

Mathematics Subject Classification ID

Related Items (32)

The close relation between border and Pommaret marked bases ⋮ On deflation and multiplicity structure ⋮ The Big Mother of all Dualities: Möller Algorithm ⋮ Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases ⋮ Prony's method in several variables: symbolic solutions by universal interpolation ⋮ Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm ⋮ Numerical root finding via Cox rings ⋮ Toric eigenvalue methods for solving sparse polynomial systems ⋮ Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ Simultaneous triangularization of commuting matrices for the solution of polynomial equations ⋮ Multiplication matrices and ideals of projective dimension zero ⋮ Multidimensional realisation theory and polynomial system solving ⋮ Global minimization of multivariate polynomials using nonstandard methods ⋮ Gröbner bases, H–bases and interpolation ⋮ The multiplicity of zeros of algebraic system in eigenvalue method ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Efficiency improvement in an \(n\)D systems approach to polynomial optimization ⋮ Solving a sparse system using linear algebra ⋮ Prony's method in several variables ⋮ Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) ⋮ Parametric optimization and optimal control using algebraic geometry methods ⋮ PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES ⋮ Multivariate polynomial system solving using intersections of eigenspaces. ⋮ A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set ⋮ Using symmetries in the eigenvalue method for polynomial systems ⋮ A novel linear algorithm for \(P5P\) problem ⋮ Solving polynomial systems via symbolic-numeric reduction to geometric involutive form ⋮ Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms ⋮ Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems ⋮ Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition ⋮ Degröbnerization: a political manifesto

This page was built for publication: Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems