Matrix eigenproblems are at the heart of polynomial system solving
From MaRDI portal
Publication:4810137
DOI10.1145/242961.242966zbMath1097.65530OpenAlexW2019127701MaRDI QIDQ4810137
Publication date: 1 September 2004
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/242961.242966
Related Items
An improvement of the rational representation for high-dimensional systems ⋮ Analysis of normal-form algorithms for solving systems of polynomial equations ⋮ Prony's method in several variables: symbolic solutions by universal interpolation ⋮ On the null spaces of the Macaulay matrix ⋮ Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ Squarefree normal representation of zeros of zero-dimensional polynomial systems ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Simultaneous triangularization of commuting matrices for the solution of polynomial equations ⋮ Gröbner bases, H–bases and interpolation ⋮ On the pointwise limits of bivariate Lagrange projectors ⋮ Multivariate polynomials, duality, and structured matrices ⋮ Computation of a specified root of a polynomial system of equations using eigenvectors ⋮ Prony's method in several variables ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ On simultaneous block-diagonalization of cyclic sequences of commuting matrices ⋮ On simultaneous block-diagonalization of cyclic sequences of commuting matrices ⋮ Matrices in elimination theory ⋮ Rayleigh quotient methods for estimating common roots of noisy univariate polynomials ⋮ Computer algebra and algebraic geometry -- achievements and perspectives
This page was built for publication: Matrix eigenproblems are at the heart of polynomial system solving
