scientific article; zbMATH DE number 1253975
From MaRDI portal
Publication:4226951
zbMath0917.65048MaRDI QIDQ4226951
Robert M. Corless, Patrizia Gianni, Barry M. Trager
Publication date: 30 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical stabilitymultiple rootsreordered Schur factorizationroots of a system of multivariate polynomial equations
Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)
Related Items (32)
On deflation and multiplicity structure ⋮ Approximate gcds of polynomials and sparse SOS relaxations ⋮ Stable normal forms for polynomial system solving ⋮ Certified numerical real root isolation for bivariate nonlinear systems ⋮ Accurate solution of polynomial equations using Macaulay resultant matrices ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Generating polynomials and symmetric tensor decompositions ⋮ Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one ⋮ Toric eigenvalue methods for solving sparse polynomial systems ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ Randomized Joint Diagonalization of Symmetric Matrices ⋮ Low Rank Symmetric Tensor Approximations ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Multiplication matrices and ideals of projective dimension zero ⋮ Loss functions for finite sets ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ Multivariate polynomials, duality, and structured matrices ⋮ Solving a sparse system using linear algebra ⋮ Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems ⋮ Computation of a specified root of a polynomial system of equations using eigenvectors ⋮ On the computation of an arrangement of quadrics in 3D ⋮ Minimizing polynomials via sum of squares over the gradient ideal ⋮ Multivariate polynomial system solving using intersections of eigenspaces. ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Exact line and plane search for tensor optimization ⋮ Using symmetries in the eigenvalue method for polynomial systems ⋮ Border Basis for Polynomial System Solving and Optimization ⋮ A prolongation-projection algorithm for computing the finite real variety of an ideal ⋮ Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms ⋮ Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems
Uses Software
This page was built for publication:
