Sciweavers

171 search results - page 15 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
JAT
2010
60views more  JAT 2010»
13 years 5 months ago
Growth properties of Nevanlinna matrices for rational moment problems
We consider rational moment problems on the real line with their associated orthogonal rational functions. There exists a Nevanlinna type parameterization relating to the problem,...
Adhemar Bultheel, Pablo González-Vera, Erik...
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 2 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
DM
2008
112views more  DM 2008»
13 years 7 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
DM
2010
77views more  DM 2010»
13 years 7 months ago
Hall-Littlewood polynomials and fixed point enumeration
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
Brendon Rhoades
IFIP
2004
Springer
14 years 22 days ago
A Matrix q-Analogue of the Parikh Map
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...
Ömer Egecioglu, Oscar H. Ibarra