𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multivariate Polynomial System Solving Using Intersections of Eigenspaces

✍ Scribed by H. Michael Möller; Ralf Tenberg

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
336 KB
Volume
32
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

The solutions of a polynomial system can be computed using eigenvalues and eigenvectors of certain endomorphisms. There are two different approaches, one by using the (right) eigenvectors of the representation matrices, one by using the (right) eigenvectors of their transposed ones, i.e. their left eigenvectors. For both approaches, we describe the common eigenspaces and give an algorithm for computing the solution of the algebraic system. As a byproduct, we present a new method for computing radicals of zero-dimensional ideals.

📜 SIMILAR VOLUMES

Solving Systems of Strict Polynomial Ine
Solving Systems of Strict Polynomial Inequalities
✍ Adam Strzeboński 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 311 KB

We present an algorithm for finding an explicit description of solution sets of systems of strict polynomial inequalities, correct up to lower dimensional algebraic sets. Such a description is sufficient for many practical purposes, such as volume integration, graphical representation of solution se

Synthesis of singly-terminated ladder ne
Synthesis of singly-terminated ladder networks by multivariable array using homogeneous polynomials
✍ B. Raman; V. Ramachandran; M.O. Ahmad; M.N.S. Swamy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 988 KB

## This paper discusses a multivariable array whose elements are multivariable homogeneous polynomials which may have missing terms in any of the variables. This array permits one to obtain conditions for the realizability of a driving-point function or a transfer function as a resistively terminate