Related papers: A Contribution to the Numerics of Polynomials and …
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
In latest years, several advancements have been made in symbolic-numerical eigenvalue techniques for solving polynomial systems. In this article, we add to this list. We design an algorithm which solves systems with isolated solutions…
Using a variety of matrix techniques, the problem of locating the left eigenvalues of the quaternion companion matrices are investigated in this paper. In a recent paper, Dar et al. [6], proved that the zeros of a quaternionic polynomial…
A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson--Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically…
A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
We obtain bounds for the numerical radius of $2 \times 2$ operator matrices which improve on the existing bounds. We also show that the inequalities obtained here generalize the existing ones. As an application of the results obtained here…
We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation…
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…
The polynomial eigenvalue problem arises in many applications and has received a great deal of attention over the last decade. The use of root-finding methods to solve the polynomial eigenvalue problem dates back to the work of…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…