64 search results - page 1 / 13 » Computations with quasiseparable polynomials and matrices |
TCS
2008
13 years 7 months ago
2008
In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices gener...
NA
2008
13 years 7 months ago
2008
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...
ISSAC
2009
Springer
14 years 1 months ago
2009
Springer
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 functi...