Computations with quasiseparable polynomials and matrices

Abstract

An interplay between polynomials and dense structured matrices is a classical topic. The structure of these dense matrices is understood in the sense that their n2 entries can be “compressed” to a smaller number O(n) of parameters. Operating directly on these parameters allows one to design efficient fast algorithms for these matrices and for the related… (More)
DOI: 10.1016/j.tcs.2008.09.008

Topics

9 Figures and Tables

Statistics

051015201520162017
Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics