Numerical instability of algebraic rootfinders
From MaRDI portal
Cites work
- A stabilized normal form algorithm for generic systems of polynomial equations
- A Theory of Condition
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Accuracy and Stability of Numerical Algorithms
- Accurate solution of polynomial equations using Macaulay resultant matrices
- Adaptive Multiprecision Path Tracking
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Backward error and condition of polynomial eigenvalue problems
- Backward error, condition numbers, and pseudospectra for the multiparameter eigenvalue problem.
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Computing the common zeros of two bivariate functions via Bézout resultants
- Condition Number Analysis for Sparse Polynomial Systems
- Condition. The geometry of numerical algorithms
- Dandelin, Lobacevskii, or Graeffe
- scientific article; zbMATH DE number 3970003 (Why is no real title available?)
- scientific article; zbMATH DE number 46010 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Matrix eigenproblems are at the heart of polynomial system solving
- Minimal determinantal representations of bivariate polynomials
- Multiparameter eigenvalue problems. Volume I: Matrices and compact operators
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Mémoire sur les équations algébriques où on démontre l'impossibilité de la résolution de l'équation générale du cinquième degré.
- Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
- Numerical computation of an analytic singular value decomposition of a matrix valued function
- Numerical instability of resultant methods for multidimensional rootfinding
- Numerically solving polynomial systems with Bertini
- On the stability of computing polynomial roots via confederate linearizations
- Perturbation theory for linear operators.
- Polynomial homotopy continuation with PHCpack
- Roots of bivariate polynomial systems via determinantal representations
- Solving polynomial systems via truncated normal forms
- Solving zero-dimensional systems through the rational univariate representation
- Stepsize control for path tracking
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The Theory of Composites
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Uniform Determinantal Representations
- Using Algebraic Geometry
This page was built for publication: Numerical instability of algebraic rootfinders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907704)
