Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

TCS
2008

favoriteEmaildiscussreport

126views Theoretical Computer Science» more TCS 2008»

Computations with quasiseparable polynomials and matrices

13 years 10 months ago

Computations with quasiseparable polynomials and matrices

Download www.math.uconn.edu

In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices generalize two classical matrix classes, Jacobi (tridiagonal) matrices and unitary Hessenberg matrices that are known to correspond to real orthogonal polynomials and Szeg

Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Ol

Real-time Traffic

Algorithm | Polynomials | Quasiseparable Matrices | TCS 2008 | Theoretical Computer Science |

claim paper

Related Content

» Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank pert...

» Fast spacevariant elliptical filtering using box splines

» Symbolic computation of weighted MoorePenrose inverse using partitioning method

» On finding multiplicities of characteristic polynomial factors of blackbox matrices

» Families of irreducible polynomials of Gaussian periods and matrices of cyclotomic numbers

» Multivariate Polynomials Duality and Structured Matrices

» Computing the rank and a small nullspace basis of a polynomial matrix

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» Model Reduction in the TimeDomain Using Laguerre Polynomials and Krylov Methods

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TCS
Authors	Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Olshevsky

Comments (0)