Matrix eigenproblems are at the heart of polynomial system solving
From MaRDI portal
Cited in
(21)- Matrices in elimination theory
- Prony's method in several variables
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- On the null spaces of the Macaulay matrix
- Gröbner bases, H-bases and interpolation
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Regularization and matrix computation in numerical polynomial algebra
- Simultaneous triangularization of commuting matrices for the solution of polynomial equations
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix
- On the pointwise limits of bivariate Lagrange projectors
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Prony's method in several variables: symbolic solutions by universal interpolation
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Multivariate polynomials, duality, and structured matrices
- Square-zero derivations of matrix algebras over commutative rings
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Computation of a specified root of a polynomial system of equations using eigenvectors
- On simultaneous block-diagonalization of cyclic sequences of commuting matrices
- An improvement of the rational representation for high-dimensional systems
- Computer algebra and algebraic geometry -- achievements and perspectives
This page was built for publication: Matrix eigenproblems are at the heart of polynomial system solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810137)
