64 search results - page 2 / 13 » Computations with quasiseparable polynomials and matrices |
MOC
2000
13 years 7 months ago
2000
Given an odd prime p we show a way to construct large families of polynomials Pq(x) Q[x], q C, where C is a set of primes of the form q 1 mod p and Pq(x) is the irreducible poly...
JC
2000
13 years 7 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
ISSAC
2005
Springer
14 years 26 days ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
DATE
2002
IEEE
14 years 9 days ago
2002
IEEE
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...