Computing the isolated roots by matrix methods
From MaRDI portal
Publication:1281846
DOI10.1006/jsco.1998.0236zbMath0934.68136OpenAlexW2048961297MaRDI QIDQ1281846
Publication date: 3 April 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1998.0236
complexityresultantfloating point arithmeticnon-singular eigenvector problemroots of a zero-dimensional polynomial system
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)
Related Items
Stable normal forms for polynomial system solving, Blind algebraic identification of communication channels: symbolic solution algorithms, Symmetric tensor decomposition, Multidimensional realisation theory and polynomial system solving, Localization and perturbations of roots to systems of polynomial equations, On the computation of matrices of traces and radicals of ideals, Overdetermined Weierstrass iteration and the nearest consistent system, Bezoutian and quotient ring structure, Multivariate polynomials, duality, and structured matrices, Solving a sparse system using linear algebra, Computation of a specified root of a polynomial system of equations using eigenvectors, Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin), Improved algorithms for computing determinants and resultants, On the computation of an arrangement of quadrics in 3D, Multivariate polynomial system solving using intersections of eigenspaces., Using symmetries in the eigenvalue method for polynomial systems, A novel linear algorithm for \(P5P\) problem, Matrices in elimination theory, Complete numerical isolation of real roots in zero-dimensional triangular systems, Generalized resultants over unirational algebraic varieties
Uses Software
