Roots of Bivariate Polynomial Systems via Determinantal Representations

DOI10.1137/140983847zbMath1376.65056arXiv1506.02291OpenAlexW1679928421MaRDI QIDQ2797076

Michiel E. Hochstenbach, Bor Plestenjak

Publication date: 4 April 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

determinantal representationtwo-parameter eigenvalue problempolynomial two-parameter eigenvalue problemsystem of bivariate polynomial equations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10) Solving polynomial systems; resultants (13P15)

Related Items

On the singular two-parameter eigenvalue problem. II, Minimal determinantal representations of bivariate polynomials, Uniform Determinantal Representations, Explicit determinantal representations of up to quintic bivariate polynomials, NORMAL AND TRIANGULAR DETERMINANTAL REPRESENTATIONS OF MULTIVARIATE POLYNOMIALS, Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation

Uses Software

• Mathematica
• Matlab
• PHCpack
• Chebfun
• Bertini
• NCAlgebra
• PHClab
• rootsb
• Chebfun2
• BertiniLab
• NACLab
• MultiParEig

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On linearizations of the quadratic two-parameter eigenvalue problem
• Symmetric determinantal representation of polynomials
• Polynomials with and without determinantal representations
• Graphs, networks and algorithms.
• Constructive algebra methods for the \(L_ 2\)-problem for stable linear systems
• The computation of Kronecker's canonical form of a singular pencil
• Multiparameter eigenvalue problems. Volume I: Matrices and compact operators
• Noncommutative convexity arises from linear matrix inequalities
• On the quadratic two-parameter eigenvalue problem and its linearization
• Polynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
• Approximation algorithms for spanner problems and directed Steiner forest
• Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
• Computing the common zeros of two bivariate functions via Bézout resultants
• LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future
• Numerical Solution of Bivariate and Polyanalytic Polynomial Systems
• Linear matrix inequality representation of sets
• Computing Hermitian determinantal representations of hyperbolic curves
• On the singular two-parameter eigenvalue problem
• Matrix Analysis
• Alternatives to the Rayleigh Quotient for the Quadratic Eigenvalue Problem
• Algorithm 795
• A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Numerical Polynomial Algebra
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• On the Pseudospectra of Matrix Polynomials
• An Extension of Chebfun to Two Dimensions
• Computer Algebra in Scientific Computing