Analysis of normal-form algorithms for solving systems of polynomial equations

DOI10.1016/j.cam.2022.114235zbMath1498.65066arXiv2104.03526OpenAlexW3140347515MaRDI QIDQ2141566

Kate Wall, Daniel Christensen, Lukas Erekson, Suzanna Parkinson, Hayden Ringer, Erik Parkinson, Tyler J. Jarvis

Publication date: 25 May 2022

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.03526

zbMATH Keywords

normal formspolynomial systemsnumerical linear algebraMacaulay matrixMöller-Stetter matrices

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of roots of polynomial equations (65H04)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On estimating the condition of eigenvalues and eigenvectors
• A stabilized normal form algorithm for generic systems of polynomial equations
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
• Numerical Instability of Resultant Methods for Multidimensional Rootfinding
• Condition
• Solving Transcendental Equations
• Using Algebraic Geometry
• Solving Polynomial Systems via Truncated Normal Forms
• Matrix eigenproblems are at the heart of polynomial system solving
• Numerical Polynomial Algebra
• Computing floating-point Gröbner bases accurately
• A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
• Multivariate polynomial system solving using intersections of eigenspaces.

This page was built for publication: Analysis of normal-form algorithms for solving systems of polynomial equations