171 search results - page 3 / 35 » On Chebyshev Polynomials of Matrices |
ISCAS
2007
IEEE
14 years 1 days ago
2007
IEEE
— The paper presents a new approach to the Volterra analysis of analog circuits. This kind of analysis is widely used for the calculation of distortion and intermodulation produc...
PC
2002
13 years 5 months ago
2002
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
DM
2007
13 years 5 months ago
2007
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
DM
2006
13 years 5 months ago
2006
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
COMBINATORICS
2000
13 years 5 months ago
2000
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...