Numerical Instability of Resultant Methods for Multidimensional Rootfinding
From MaRDI portal
Publication:2796860
DOI10.1137/15M1022513zbMath1382.65144arXiv1507.00272MaRDI QIDQ2796860
Publication date: 30 March 2016
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.00272
Numerical computation of solutions to systems of equations (65H10) Numerical computation of matrix norms, conditioning, scaling (65F35) Solving polynomial systems; resultants (13P15)
Related Items (6)
High-order quadrature on multi-component domains implicitly defined by multivariate polynomials ⋮ Analysis of normal-form algorithms for solving systems of polynomial equations ⋮ Solving Singular Generalized Eigenvalue Problems. Part II: Projection and Augmentation ⋮ Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach ⋮ Computing the homology of real projective sets ⋮ Computing the homology of semialgebraic sets. II: General formulas
Uses Software
Cites Work
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Finding all real zeros of polynomial systems using multi-resultant
- A numerical method for polynomial eigenvalue problems using contour integral
- Computing curve intersection by means of simultaneous iterations
- Polynomial evaluation and associated polynomials
- Fast computation of the Bézout and Dixon resultant matrices
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- Backward error and condition of polynomial eigenvalue problems
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Discriminants, resultants, and multidimensional determinants
- Computing the common zeros of two bivariate functions via Bézout resultants
- The Quadratic Eigenvalue Problem
- Block Tensor Unfoldings
- Numerical Solution of Bivariate and Polyanalytic Polynomial Systems
- Solving Transcendental Equations
- Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
- Fiedler Companion Linearizations and the Recovery of Minimal Indices
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- The Method of Resultants for Computing Real Solutions of Polynomial Systems
- Algorithms for intersecting parametric and algebraic curves I
- Using Algebraic Geometry
- Accuracy and Stability of Numerical Algorithms
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Accurate solution of polynomial equations using Macaulay resultant matrices
- An Algorithm for Quadratic Eigenproblems with Low Rank Damping
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- An Extension of Chebfun to Two Dimensions
- Vector Spaces of Linearizations for Matrix Polynomials
- Functions of Matrices
- Computer Algebra in Scientific Computing
- Computation of a specified root of a polynomial system of equations using eigenvectors
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Numerical Instability of Resultant Methods for Multidimensional Rootfinding
