Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
eigenproblem approacheigenvalueeigenvectorGröbner basisisolated zerosJordan normal form decompositionmatrix eigenproblemsmultiple zerosnonderogatory matricessystems of polynomial equations
Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
The paper deals with the eigenproblem approach for solving systems of polynomial equations. In particular, the case of isolated zeros only is considered. From a Gröbner basis of the zero-dimensional ideal generated by the polynomial equations an \(n\times n\)-matrix \(A_f\), depending on some suitable polynomial \(f\), can be computed. Here \(n\) denotes the number of zeros counted with multiplicity. The case of simple zeros only, which is shortly reviewed, leads to the classical eigenvalue/eigenvector problem for \(A_f\). The intention of the present paper is to extend the theory to the case of multiple zeros. It results in a generalization of the Jordan normal form decomposition of \(A_f\). The case of nonderogatory matrices \(A_f\) is specially addressed. An algorithmic analysis of the eigenproblem in the general case is indicated.
- Publication:4860588
- scientific article; zbMATH DE number 871307
- scientific article; zbMATH DE number 500427
- Multivariate polynomial system solving using intersections of eigenspaces.
- Solutions of matrix polynomial equations
- Publication:4860595
- scientific article; zbMATH DE number 5161416
- On solvability of matrix polynomial equations
- On the numerical solution of matrix polynomial equations
- Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Including iterations for the Lambda-matrix eigenproblem
- An algorithm to construct matricial solutions of a polynomial system of equations
- Multiplication matrices and ideals of projective dimension zero
- The multiplicity of zeros of algebraic system in eigenvalue method
- Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems
- Degröbnerization: a political manifesto
- The close relation between border and Pommaret marked bases
- Numerical root finding via Cox rings
- 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
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- A novel linear algorithm for \(P5P\) problem
- On deflation and multiplicity structure
- Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases
- Gröbner bases, H-bases and interpolation
- A multiprecision algorithm for the solution of polynomials and polynomial eigenvalue problems
- PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 465399 (Why is no real title available?)
- scientific article; zbMATH DE number 503184 (Why is no real title available?)
- Simultaneous triangularization of commuting matrices for the solution of polynomial equations
- Global minimization of multivariate polynomials using nonstandard methods
- Multidimensional realisation theory and polynomial system solving
- scientific article; zbMATH DE number 949696 (Why is no real title available?)
- Overdetermined Weierstrass iteration and the nearest consistent system
- The Big Mother of all Dualities: Möller Algorithm
- scientific article; zbMATH DE number 834477 (Why is no real title available?)
- scientific article; zbMATH DE number 834485 (Why is no real title available?)
- scientific article; zbMATH DE number 871307 (Why is no real title available?)
- Solving a sparse system using linear algebra
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- Toric eigenvalue methods for solving sparse polynomial systems
- Prony's method in several variables
- An eigenvalue theorem for systems of polynomial equations
- Parametric optimization and optimal control using algebraic geometry methods
- Multivariate polynomial system solving using intersections of eigenspaces.
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Numerical instability of algebraic rootfinders
- Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding
- Explicit commutative ROABPs from partial derivatives
- Using symmetries in the eigenvalue method for polynomial systems
- Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
This page was built for publication: Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893493)
