Pseudo-Companion Matrices for Polynomial Systems
Melinda Kleczynski
Abstract
Open-access reader
Melinda Kleczynski
Abstract
Open-access reader
Roots of a scalar polynomial in one variable are frequently found by computing the eigenvalues of the standard companion matrix. In this exploratory work, we introduce the pseudo-companion matrix for finding roots of multivariable polynomial systems. In some cases, a perturbation of the polynomial system is used for the matrix construction, yielding approximate roots of the original polynomial system. The coordinates of the roots, or their approximations, are obtained from the eigenvectors of this matrix. In this thesis, we describe the process of constructing the pseudo-companion matrix and computing the polynomial roots using illustrative examples.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Roots of a scalar polynomial in one variable are frequently found by computing the eigenvalues of the standard companion matrix. In this exploratory work, we introduce the pseudo-companion matrix for finding roots of multivariable polynomial systems. In some cases, a perturbation of the polynomial system is used for the matrix construction, yielding approximate roots of the original polynomial system. The coordinates of the roots, or their approximations, are obtained from the eigenvectors of this matrix. In this thesis, we describe the process of constructing the pseudo-companion matrix and computing the polynomial roots using illustrative examples.
Key concepts: Matrix polynomial, Companion matrix, Polynomial matrix, Characteristic polynomial, Eigenvalues and eigenvectors, Properties of polynomial roots, Mathematics, Wilkinson's polynomial