Generalised characteristic polynomials

DOI10.1016/S0747-7171(08)80012-0zbMath0704.12004MaRDI QIDQ916718

John F. Canny

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

generalized characteristic polynomialpolynomial eliminationsingle-exponential time algorithm

Mathematics Subject Classification ID

Related Items (31)

Blind algebraic identification of communication channels: symbolic solution algorithms ⋮ The Multivariate Schwartz--Zippel Lemma ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ A survey on the spectral theory of nonnegative tensors ⋮ Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints ⋮ Separation bounds for polynomial systems ⋮ Subresultants in multiple roots ⋮ Segre-driven radicality testing ⋮ Maximal number of distinct \(H\)-eigenpairs for a two-dimensional real tensor ⋮ Sparse difference resultant ⋮ Elimination theory in differential and difference algebra ⋮ Determinantal formulae for the solution set of zero-dimensional ideals ⋮ Deformation techniques for efficient polynomial equation solving. ⋮ Solving a sparse system using linear algebra ⋮ On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals ⋮ Implicit representation of rational parametric surfaces ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ An opportunistic global path planner ⋮ Improved algorithms for computing determinants and resultants ⋮ Macaulay style formulas for sparse resultants ⋮ A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals ⋮ Explicit formulas for the multivariate resultant. ⋮ A perturbed differential resultant based implicitization algorithm for linear DPPEs ⋮ Rational univariate reduction via toric resultants ⋮ Matrices in elimination theory ⋮ Solving degenerate sparse polynomial systems faster ⋮ IMPLICITIZATION OF SURFACES IN ℙ³ IN THE PRESENCE OF BASE POINTS ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Construction of roadmaps in semi-algebraic sets ⋮ Computation of the solutions of nonlinear polynomial systems ⋮ Sparse differential resultant for Laurent differential polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for the degrees in the Nullstellensatz
• Résolution des systèmes d'équations algébriques
• The complexity of the word problems for commutative semigroups and polynomial ideals
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
• Fast Parallel Matrix Inversion Algorithms

This page was built for publication: Generalised characteristic polynomials