Dec 19, 2022 · This paper describes algorithms to recover matrices with known structures, such as tridiagonal, Toeplitz, Toeplitz-like, and hierarchical low-rank, from matrix-vector products.

Abstract A resultant matrix of two polynomials is a matrix whose entries are functions of the polynomial coefficients, and such that the polynomials have a common root if and only if the determinant of this …

In this paper we construct a sequence of linearly structured resultant matrices from given polynomials a(s) and b(s). We show that the full rank property of some resultant matrix in the sequence is …

Noise was added to these polynomials, and the method of STLN was used to com-pute a structured low rank approximation of the Sylvester matrix formed from these noisy polynomials.

Filtering by:"Reconstruction Via A Structured Resultant Matrix" pdf downloadRemove constraint "Reconstruction Via A Structured Resultant Matrix" pdf downloadResource typeResearch …

The GCD computations are performed using the Sylvester resultant matrix, which is a structured matrix, and thus a structure-preserving matrix method is used to obtain a deblurred image.

matrices are nearly structured. We discuss the conditions for using the nearest structured matrix to the nearly structured one by an lysing the forward error bounds. Since the structure preserving …

A non-linear structure preserving matrix method for the computation of a structured low rank approximation S (f ,g) of the Sylvester resultant matrix S (f, g) of two inexact polynomials f = f (y) and …

This paper presents some conditions for the homogeneous coordinates of a certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant …

We collect here some results on the structure of sums, products and in- verses of displacement structured matrices. These results prove useful when one needs to perform arithmetic operations on …