Roots multiplicity without companion matrices

03/17/2017
by   Przemysław Koprowski, et al.
0

We show a method for constructing a polynomial interpolating roots' multiplicities of another polynomial, that does not use companion matrices. This leads to a modification to Guersenzvaig--Szechtman square-free decomposition algorithm that is more efficient both in theory and in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2017

A non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications

We present a non-commutative algorithm for multiplying 5x5 matrices usin...
research
06/08/2018

Hadamard Matrices, Quaternions, and the Pearson Chi-square Statistic

We present a symbolic decomposition of the Pearson chi-square statistic ...
research
11/21/2022

The Berlekamp-Massey Algorithm revisited

We propose a slight modification of the Berlekamp-Massey Algorithm for o...
research
08/29/2014

Binary matrices of optimal autocorrelations as alignment marks

We define a new class of binary matrices by maximizing the peak-sidelobe...
research
11/01/2017

Assessing the reliability polynomial based on percolation theory

In this paper, we study the robustness of network topologies. We use the...
research
11/26/2019

Approximating the Permanent by Sampling from Adaptive Partitions

Computing the permanent of a non-negative matrix is a core problem with ...

Please sign up or login with your details

Forgot password? Click here to reset